Lecture 16: Dijkstra

Published: Dec. 7, 2012, 7:48 p.m.

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.