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.

a (6,10) graph
a (16,33) graph
a (12,23) graph
a (16,33) digraph
a (9,15) graph
a (48,77) graph
a (8,12) graph