Today:
- Announcements
- I'm collecting 5.3 homework today.
- I'm returning 5.2 homework:
- 13
- 14 -- I think that this is a really interesting exercise,
since it shows us how to write an arbitrary tree with a binary
tree representation....
- 21
- 48
- Last time we looked at section 6.2: Euler Paths and Hamiltonian Circuits
- Today we'll check out section 6.3: Shortest Path and Minimal Spanning Tree
Links:
Website maintained by Andy Long.
Comments appreciated.