Day 18: Mat385

Last time: Started 6.2: Euler Paths and Hamiltonian Circuits

Next time: section 6.4: Traversal Algorithms

Today:

Collect Homework: Section 5.3
Return Homework, Section 5.2:
- #2: yes, no, yes, b, none, 2, 3
- #21:
  - preorder: abdhicefg
  - inorder: hdibaecfg
  - postorder: hidbefgca
A little more on Section 6.2: Euler Paths and Hamiltonian Circuits
Questions on Homework for 6.2?
Section 6.3: Shortest Path and Minimal Spanning Tree

Website maintained by Andy Long. Comments appreciated.