Day 19:
Mat385
Last time
: Euler paths and Hamiltonian Circuits
Next time
: Graph traversal
Today
:
Return Section 5.2 homework:
#13
and 22
Collect Homework, Section 5.3
A little more on
Section 6.2
: Euler Paths and Hamiltonian Circuits
Section 6.3
: Shortest Path (
more details here
) and Minimal Spanning Tree
Website maintained by
Andy Long
. Comments appreciated.