Dijkstra’s Algorithm is used to find the shortest path between two nodes of a weighted graph. The algorithm is pretty simple and goes as follows

Code Blogs

Dijkstra’s Algorithm is used to find the shortest path between two nodes of a weighted graph. The algorithm is pretty simple and goes as follows