- Announcements:
- Our quiz this week will cover chapter 7 (graph algorithms)
- Euler paths and Hamiltonian Circuits
- Shortest path and Minimal spanning trees
- Graph traversal (depth-first, breadth-first)
- How are
your projects coming?
- Today:
- Last time: We finished
Section
7.3: Shortest Path and Minimal Spanning Tree, and
started Section
7.4 (depth-first and breadth-first); I want to look at one
more example from the graph traversal
handout for 7.4 before moving on into chapter 8.
- We examined five different algorithms last time:
- Floyd's (all shortest paths)
- Prim's
- Kruskal's
- Depth-first traversal of graphs
- Breadth-first traversal of graphs
- Then we had a quiz:
- Key
- There was a little confusion about the "main connective"
-- order of operations. The first difference is the root of the
expression tree.
- I didn't hear any singing on Problem 2 -- maybe that would
have helped?
- Missing a lot of floor functions: \(\lfloor \log_2(10)
\rfloor +1 = 4\).
- Today's new thing is Section 8.1: Boolean Algebras
- Links:
Website maintained by Andy Long.
Comments appreciated.