- Last Time: Dijkstra's Algorithm
- Today:
- To collect or not to collect homework for 6.2: that is the question....
- The motivating graph I couldn't find from last time....
- Continue with Section
6.3: Shortest Path and Minimal Spanning Tree
- If there's time, we'll look at the associated problems: #1, 3, 8/10,
10/12, 13/15, 15/17, 17/19, 18/20, 19/21, 21/23, 23/25
- Next Time: Section 6.4
Website maintained by Andy Long.
Comments appreciated.
