Day 19:
Mat385
Last time
: Finished 6.2 (Euler Paths and Hamiltonian Circuits), and started 6.3: Shortest path
Next time
: section 7.1: Boolean Algebra Structure
Today
:
Return Section 5.3 homework: #5 and #7, both in the book.
Collect Homework: Section 6.2
A little more on
Section 6.3
: Shortest Path (
more details here
) and Minimal Spanning Tree
Questions on Homework for 6.3?
Section 6.4
: Traversal Algorithms
Website maintained by
Andy Long
. Comments appreciated.