Dijkstra’s Algorithm —

In this article we are going to understand one of the most popular distance finding algorithm with non-negative edge weights in Graph. (Source: Wikipedia) Problem Statement: Given a weighted graph G with vertices V and edges E, and a source vertex s...