EnglishAdvanced

Dec 20, 2020 • 2h

332k watch mins

In this lecture, we will discuss Dijkstra's Algorithm to find single source shortest path in weighted directed and undirected graphs. We will also touch upon the concept of the shortest path spanning tree.