Day 18: Mat385

Last time: Decision Trees

Next time: section 6.3: Shortest Path algorithms and Minimal Spanning Trees

Today:

Next time: Collect Homeworks, Sections 5.2, 5.3
Return Homework, Section 5.1:
A little more on Section 5.3 (pdf): Decision Trees
Section 6.2 (pdf): Euler Paths and Hamiltonian Circuits

Links:

The Traveling Salesman problem
Konigsberg bridges problem

Website maintained by Andy Long. Comments appreciated.