Dijkstra's Algorithm is used to find the shortest path between nodes of a weighted graph.

Number of vertices:

Chose a number of vertices.

Enter edge values.

Click a node to set as Start Node.

Click a node to set as End Node.