Dijkstra's Algorithm Visualizer
A graph visualization tool that can simulate Dijkstra's shortest path algorithm.
Priority Queue
Vertex | Distance |
---|
Select a vertex to start with.Please make sure all vertices have a label and all edges have a weight.Please add a few vertices first.Visualizing Dijkstra's Algorithm...
Use the canvas to build your graph.
To add a vertex:
double-click, then add a label by typing a unique alphabetic character
To add an edge:
shift+drag from one vertex to another, then add a weight by typing a number
To move a vertex:
drag it
To edit an element:
click it
To delete an element:
press the delete key (fn + delete on mac)
Speed
.25x | .5x | 1x | 2x | 4x |
Made by
Jan Smailbegovic
in 2024 • GitHub