> For the complete documentation index, see [llms.txt](https://cs61b-2.gitbook.io/cs61b-textbook/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://cs61b-2.gitbook.io/cs61b-textbook/25.-minimum-spanning-trees.md).

# 25. Minimum Spanning Trees

- [25.1 MSTs and Cut Property](https://cs61b-2.gitbook.io/cs61b-textbook/25.-minimum-spanning-trees/25.1-msts-and-cut-property.md)
- [25.2 Prim's Algorithm](https://cs61b-2.gitbook.io/cs61b-textbook/25.-minimum-spanning-trees/25.2-prims-algorithm.md): Finding MST.
- [25.3 Kruskal's Algorithm](https://cs61b-2.gitbook.io/cs61b-textbook/25.-minimum-spanning-trees/25.3-kruskals-algorithm.md): Finding MST.
- [25.4 Chapter Summary](https://cs61b-2.gitbook.io/cs61b-textbook/25.-minimum-spanning-trees/25.4-chapter-summary.md)
- [25.5 MST Exercises](https://cs61b-2.gitbook.io/cs61b-textbook/25.-minimum-spanning-trees/25.5-mst-exercises.md)