## Dijkstra’s Shortest Path

The Dijkstra algorithm solves the single-source shortest path problem.For a given source node in the graph, the algorithm finds the shortest path between that node and every other. It can also be used for finding the shortest paths from a single node to a single destination node by stopping the algorithm once the shortest path…