Day 18:
Mat385
Last time
: Decision Trees
Next time
: section 6.3: Shortest Path algorithms and Minimal Spanning Trees
Today
:
Collect Homework: Section 5.2
Return Homework, Section 5.1:
A little more on
Section 5.3
: Decision Trees
Section 6.2
: Euler Paths and Hamiltonian Circuits
Website maintained by
Andy Long
. Comments appreciated.