Dear Ross, the runtime to calculate the strongest path from every candidate to every other candidate is O(C^3). However, the runtime to sort O(C^2) pairwise defeats is already O(C^4). So you cannot get a faster algorithm by sorting the pairwise defeats.
Markus Schulze ---- Election-Methods mailing list - see http://electorama.com/em for list info
