Day 20:
Mat385
Last time
: 6.3: Shortest path and Minimal spanning tree
Next time
: section 7.1: Boolean Algebras
Today
:
Return Section 5.2 and 5.3 homework
Note on in-order traversal: first child is left!
Check the solutions in the back when available... guilt free!
Collect homework Section 6.2 (with grace for those who didn't get it done_).
Section 6.3 due next time.
Section 6.3
(
pdf
): Shortest Path (
more details here
(
pdf
)) and Minimal Spanning Tree
Section 6.4
(
pdf
): Traversal Algorithms
Website maintained by
Andy Long
. Comments appreciated.