docs: def isFullPreferenceOrder(self, candList):
          """
          Returns True if the underlying weighted majority graph contains a comparision between every
          pair of candidate and returns False otherwise.
  
          :ivar list<int> candList: Contains integer representations of each candidate.
          """
  
          # If a candidate is missing from the wmgMap or if there is a pair of candidates for which 
          # there is no value in the wmgMap, then the wmgMap cannot be a full preference order.
          for cand1 in candList:            
              if cand1 not in self.wmgMap.keys():
                  return False
              for cand2 in candList:
                  if cand1 == cand2:
                      continue
                  if cand2 not in self.wmgMap[cand1].keys():
                      return False
          return True