Last time: Finished 6.2 (Euler Paths and Hamiltonian Circuits), and started 6.3: Shortest path
Today:
- Return Section 5.3 homework:
- Collect Homework: Section 6.2
- A little more on Section
6.3: Shortest Path (more details here)
and Minimal Spanning Tree
- Questions on Homework for 6.3?
- Section
6.4: Traversal Algorithms
Next time: section 7.1: Boolean
Algebra Structure
Website maintained by Andy Long.
Comments appreciated.
