Dijkstra, Leetcode Medium, Graph, Cpp.
Dijkstra’s Algorithm finds shortest path from source node to all other nodes in Graph. There are other algorithms for finding shortest path example Floyd-Warshall for Multi source computes the shortest distances between every pair of vertices in graph. But we will explore working algorithm of