A visualiser for Dijkstra's shortest path algorithm. https://cameronjpr.github.io/dijkstra-visualiser/
- Click to place new nodes
- Drag between nodes to add edges.
- Double click on a node to set it as the start node
- Double click on another node to set it as the end node
- Press enter on your keyboard to calculate and display the shortest path from the start node to end node