User talk:MarkusSchulze/Short version of the Schulze method

Hello.

Has there been any research on which method to find p[A,B] for each candidate is the most effective? (I feel that there probably exists optimizations that computes that better than by using a modified dijkstra for each candidate.) If so, please refere to them :]

Thanks!

The best algorithms to solve the all-pairs shortest path problem have a cubic runtime in worst case. Markus Schulze 22:33, 23 September 2009 (UTC)[reply]