docs: def getInitialSample(self, wmg):
          """
          Generate an initial sample for the Markov chain. This function will return a 
          two-dimensional array of integers, such that for each pair of candidates, cand1 and cand2,
          the array contains 1 if more votes rank cand1 above cand2 and 0 otherwise.
  
          ivar: dict<int,<dict,<int,int>>> wmg: A two-dimensional dictionary that associates integer
              representations of each pair of candidates, cand1 and cand2, with the number of times
              cand1 is ranked above cand2 minus the number of times cand2 is ranked above cand1. The
              dictionary represents a weighted majority graph for an election.
          """
  
          cands = range(len(wmg))
          allPairs = itertools.combinations(cands, 2)
          V = self.createBinaryRelation(len(cands))
          for pair in allPairs:
              if wmg[pair[0]+1][pair[1]+1] > 0:
                  V[pair[0]][pair[1]] = 1
                  V[pair[1]][pair[0]] = 0
              else:
                  V[pair[0]][pair[1]] = 0
                  V[pair[1]][pair[0]] = 1
          return V