This tool illustrates finding the shortest path in a graph in two ways:
The naive strategy enumerates all possible paths from the initial node (in green) to the final node (in
red).
The Dijkstra strategy incrementally builds a tree of shortest-paths from the initial node (in green)
using Dijkstra's shortest-path algorithm.
The naive strategy might appear reasonable but it does not scale. Use
the Hard Map button to get a map with many paths and compare
the naive enumeration to Dijkstra's solution.
The code requires HTML Canvas support in your browser. If it does not
work, try using the Google Chrome browser with which the code has been
tested.