Dijkstra's Shortest Path Algorithm

Add Node

Node label Tip: Try to use shorter labels

Cancel Add Node

Add Edge

Edge weight

Cancel Add Edge

Dijksta's Algorithm

Starting node

Ending node

[ ! ] Start and end points cannot be the same!

Test Mode: Make your own prediction

Cancel Run Algorithm

Setting your prediction

Compare your human intuition to the algorithm's result!

Click on a neighbouring node to add to your predicted path

Click on the source node to remove it from your predicted path

Click the run button again when you're done to run the algorithm

Don't show me this again

Continue

Visualising Dijkstra's Algorithm

Check out the GitHub repo for the source code.

Layout created with Materialize CSS.

Close

ID	Node	Cost from starting node	Node check priority	Previously visited from