CSSE 230: Session Notes - Day 25

Topics

  1. Minimum spanning tree (MST) of a graph
  2. Prim's algorithm to find an MST
  3. Kruskal's algorithm to find an MST

Outline

  1. [5 min] Contact before work
  2. [5 min] Spanning tree
  3. [10 min] Minimum spanning tree
  4. [10 min] Prim's algorithm for finding an MST
  5. [10 min] Kruskal's algorithm for finding an MST
  6. [balance of time] Work on pair project.

Resources

Assignment