Mathematical Programming 
Dijkstra's Algorithm 

Dijkstra Dijkstra JavaScript demos: FAQ Japanese/English 
Shortest Path ProblemGiven a connected graph G=(V,E), a weight d:E>R+ and a fixed vertex s in V, find a shortest path from s to each vertex v in V.
Dijkstra's AlgorithmDijkstra's algorithm is known to be a good algorithm to find a shortest path.
JavaScript Source File:JavaScript Demos
See Also

Kenji Ikeda's Home Page 
Last Modified:
Tuesday, 01Sep2015 11:17:41 JST
