DIJKTRA'S ALGORITM

Please enable Java for an interactive construction (with Cinderella). shortened version
1. Start at a root vertex (in our case, s).
2. Find an edge e that advances to terminal vertex t with minimum distance from s.











Intro to Graph Theory-Wilson pg.38