Dijkstra, Weighted Graph, Data Structure Algorithm, Algorithms, Graph Data Structure.
seeks to find the shortest path between two nodes in a weighted graph. Let’s take an example of a road network as graph and weights on the edge may represent the traffic, speed limit and any other factors which limits the travelling. As shown in the map, you’re starting point and destination are