Algorithms, Programming, Interview, Python.
distances of other vertices which can be reached by one edge. It then continues to find a path with two edges and so on. This algorithm also works on graphs with a negative edge weight. Initializes the distance to the source to 0 and all other nodes to INFINITY. For all edges, if the distance to