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