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

SEE ALSO

- Minimum Spanning Tree by Prim's Algorithm
- Minimum Spanning Tree by Kruskal's Algorithm
- Max Flow by Ford-Fulkerson's Labeling Algorithm

Last Modified: Thu May 22 09:10:56 JST 1997

Mail to: ikeda@is.tokushima-u.ac.jp