Weighted Graphs (18)
Michael L. Littman
November 11th, 1997
ANNOUNCEMENTS
NETWORK FLOW
Review
Network Flow
Maximum Flow Problem
Matching as Network Flow
Linear Programming
LP Algorithms
MINIMUM SPANNING TREES
Water For Everyone
Mathematical Abstraction
Simple Verification
Optimization Verification
FINDING MINIMUM SPANNING TREES
Design Ideas
Greedy Approach
Cuts
Greedy-Grow Lemma
Correctness of G
ENERIC
-MST
Efficient Implementation
HOMEWORK
Homework 9
Homework 10 (incomplete)
Next:
ANNOUNCEMENTS