Python, Graph, Algorithms.
pairs of vertices. The algorithm works by repeatedly improving an estimate on the shortest path between two vertices, until ultimately obtaining the shortest path. It does so by assuming that the shortest path can have at most i intermediate vertices (for some i), and then improving the estimate by