An efficient Cython implementation of the Floyd-Warshall algorithm for finding the shortest path distances between all pairs of vertices in a weighted directed graph.
See http://en.wikipedia.org/wiki/Floyd-Warshall_algorithm
Feel free to ask any questions: moscovich@gmail.com
Amit Moscovich Eiger.