Single-Source shortest Paths
Input directed graph G = (V,E) (m = |E|, n = |V|)
---each edge has nonnegative length
---source vertex s
output: for each v, compute L(v) = length of a shortest s-v path in G
pseudocode:
Initialize:
X = {s} //vertices processed so far
A[s] = 0 //computed shortest path distance
B[s] = empty path //computed shortest path
main loop:
while X != V: // Dijkstra's greedy criterion
---among all edges [v,w], with v belongs to X, w doe