Name: Lecture 16: Dijkstra
Uploaded: 2013-01-14T20:26:48Z
Duration: 51 min 26 s
Description: 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

51:26

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