Dijkstra's algorithm for finding shortest paths

• Java applet demos - Kenji Ikeda
• Java applet demo - Kenji Ikeda
• Create a network.

• Kruskal's algorithm demos - Kenji Ikeda
• Kruskal's algorithm - random problems
• Prim's algorithm demos - Kenji Ikeda
• Prim's algorithm - create problems

Pathfind - Random points are plotted in the plane. Find the shortest path passing through all the points:

• closed circuit
• arbitrary open path
• path with fixed departure point
• path with fixed arrival point
• path with fixed departure and arrival points