L06 : Dijkstra's Algorithm | Graph Theory Part 2 | CodeNCode

In this lecture we will learn Dijkstra's Algorithm using which you can find shortest distance from a source node to every other node in graph. Graph Theory Part 2 Course : https://www.youtube.com/playlist?list=PL5DyztRVgtRW0Kdd8i1xML7t-ge56XRQR