Computing Minimum Spanning Trees (19)
Michael L. Littman
November 13th, 1997
ANNOUNCEMENTS
KRUSKAL'S ALGORITHM
Recall
Our Algorithm
Correctness
Implementation
Simple Implementation
Better Implementation
Implementation
Running Time
FAST UNION-FIND
Quick Aside
Clever Data Structure
Culture
PRIM'S ALGORITHM
Invent Another Algorithm
Idea
Algorithm
Running-Time Analysis
Better Data Structure
Even Better Data Structure
HOMEWORK
Homework 9
Homework 10
Next:
ANNOUNCEMENTS