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

# 8. Minimum Spanning Trees

## Contents

1. [Abstraction](/dsa-java/minimum-spanning-trees/abstraction.md)
2. [Prim's Algorithm](/dsa-java/minimum-spanning-trees/prims-algorithm.md)
3. [Kruskal's Algorithm](/dsa-java/minimum-spanning-trees/kruskals-algorithm.md)
4. [Chu-Liu-Edmonds' Algorithm](/dsa-java/minimum-spanning-trees/edmonds-algorithm.md)
5. [Quiz](/dsa-java/minimum-spanning-trees/exercises.md)
6. [Homework](/dsa-java/minimum-spanning-trees/homework.md)

## References

* [Prim's Algorithm](https://en.wikipedia.org/wiki/Prim's_algorithm)
* [Kruskal's Algorithm](https://en.wikipedia.org/wiki/Kruskal's_algorithm)
* [Chu-Liu-Edmonds' Algorithm](https://en.wikipedia.org/wiki/Edmonds'_algorithm)