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