Dijkstra's Algorithm | Single Source Shortest Path | Graph Theory | By :- Harendra Sharma

[@2788sanju]

Kindly use different coloured markers.. it will facilitate better understanding .. 🌝

[@sumiyatamannur423]

I think the shortest will be 12, not 14.

[@BhaiBhaiTutorials]

We don't have to find MST.
By this algo we only find the minimum shortest path between source vertex to other remaining vertices as I explain it..

[@anmolsingh8660]

Sir kisi directed graph main kaise nikalenge shortest path.

[@BhaiBhaiTutorials]

Same Method h directed and undirected graph m.
Directed Graph m aapko adjacent dekhna hota h like A to B edge h ya B to A