8. Minimum Spanning Trees

This chapter discusses algorithms to find minimum spanning trees in undirected and directed graphs.

Contents

1. Abstraction

2. Prim's Algorithm

3. Kruskal's Algorithm

4. Chu-Liu-Edmonds' Algorithm

5. Quiz

6. Homework

References

• Prim's Algorithm

• Kruskal's Algorithm

• Chu-Liu-Edmonds' Algorithm