- Last Time: Dijkstra's Algorithm
- Today:
- Return homework 6.2: problems 6 and 8
- As promised, details of Dijkstra's and Bellman-Ford on-line.
- Let's quickly
wrap-up Section 6.3: Shortest Path and Minimal Spanning Tree
-
- Are there any problems you'd like to look at, before we move on?
- #1, 3, 8/10,
10/12, 13/15, 15/17, 17/19, 18/20, 19/21, 21/23, 23/25
- Let's start Section
6.4: Traversal Algorithms
- Next Time: Section 6.4
(continued? problems?)
Website maintained by Andy Long.
Comments appreciated.
