Shortest Path Problem
Given 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 algorithm is known to be a good algorithm to find
a shortest path.
Here are some JAVA applet demos
of shortest path problem by Dijkstra's algorithm.
Thu May 22 09:10:56 JST 1997