Introduction to Algorithms and Data Structures, Fall 2004, Episode 10

Lecture, April 15

Subject : Minimum spanning trees. Kruskal's algorithm. Single-source shortest paths in weighted graphs. The Bellman–Ford algorithm.

Text : CLRS 23.1–23.2 (Prim's algorithm is optional); CLRS 24.1.

Prerequisites : Directed and undirected graphs. Trees. Paths in graphs. Connected components.

Time : Friday, April 15, 9:00–12:00 (3×45min), Room 2A12

Tutorial : 13:00–16:00 (3×45min), Room 3A14