code: def getCandScoresMap(self, profile):
          
  
          cands = profile.candMap.keys()
          pairwisePreferences = self.computePairwisePreferences(profile)
          strongestPaths = self.computeStrongestPaths(profile, pairwisePreferences)
  
          # For each candidate, determine how many times p[E,X] >= p[X,E] using a variant of the
          # Floyd-Warshall algorithm.
          betterCount = dict()
          for cand in cands:
              betterCount[cand] = 0
          for cand1 in cands:
              for cand2 in cands:
                  if cand1 == cand2:
                      continue
                  if strongestPaths[cand1][cand2] >= strongestPaths[cand2][cand1]:
                      betterCount[cand1] += 1
  
          return betterCount
docs: Returns a dictionary that associates integer representations of each candidate with the
          number of other candidates for which her strongest path to the other candidate is greater
          than the other candidate's stronget path to her.
  
          :ivar Profile profile: A Profile object that represents an election profile.