CSSE 230: Session Notes - Day 25
Topics
- Minimum spanning tree (MST) of a graph
- Prim's algorithm to find an MST
- Kruskal's algorithm to find an MST
Outline
- [5 min] Contact before work
- [5 min] Spanning tree
- [10 min] Minimum spanning tree
- [10 min] Prim's algorithm for finding an MST
- [10 min] Kruskal's algorithm for finding an MST
- [balance of time] Work on pair project.
Resources
Assignment