An illustration of the shortest-path problem

This tool illustrates finding the shortest path in a graph in two ways:

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.

To access the Dart source code see our Github repository: