If the edges of our graph have weights, we say we have a weighted graph. These weights can represent factors such as cost, distance, complexity etc.
A common application of weighted graph is finding the shortest path between two nodes.
It is one of the classic algorithm for finding the shortest path between two nodes of a graph. It was developed by dutch scientist Dijkstra.
It is a greedy Algorithm, which finds the optimal solution to a problem by making optimal choices at each step.
5- Dijkstra_s Shortest Path Algorithm.mp4
Extend the tree by adding the smallest connected edge