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 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: https://github.com/jakobgt/dajkstra

— — — —