What is Dijkstra’s Algorithm?
Dijkstra’s Algorithm is used for finding the shortest path between any two vertices of a graph. It uses a priority queue for finding the shortest path.
For more detail about Dijkstra’s Algorithm, you can refer to this article.