Day 24, Mat385

Last time

Next time

Announcements:
- Our quiz covers trees again: section 6.2 and 6.3
- I was exposed to someone with Covid over the weekend, so I'll be masked for today. If anything ugly should arise, I may be switching to Zoom....
Today:
- Last time: We finished Section 7.2 (Euler Paths and Hamiltonian Circuits), and then started into Section 7.3: Shortest Path and Minimal Spanning Tree.
- We'll start with a quick review of our work on Dijkstra's algorithm, and Bellman-Ford; and then consider a third algorithm (Floyd's), which finds the distance between any pair of nodes (but doesn't provide the path).
  So back to page 1 of our handout from last time.
- We also need to talk about minimal spanning trees (easy peasy). Two algorithms for that:
  1. Prim's
  2. Kruskal's
- Then we'll get into the two graph traversal algorithms of Section 7.4 (depth-first and breadth-first), which can be handled by creating reasonable trees:
  1. graph traversal handout
  2. Breadth-first.nb
Links:
- Rooted Trees
- Using a directed, acyclic graph to represent an algebraic operation: Supplementary Material On-line

Website maintained by Andy Long. Comments appreciated.