MIT

Lecture 16: Dijkstra

Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceEngineering

Om kurset

Description: This lecture shows how to find shortest paths in directed acyclic graphs (DAGs) using topological sort, and in graphs without negative edges using Dijkstra’s algorithm. Instructor: Srini Devadas