> For the complete documentation index, see [llms.txt](https://algorithm.prettylog.com/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://algorithm.prettylog.com/overview/3.-how-to-construct-algorithm-paradigm/mst-minimum-spanning-tree.md).

# MST (Minimum Spanning Tree)

{% embed url="<https://ongveloper.tistory.com/376>" %}

{% embed url="<https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/>" %}

[Detect a cycle in a Graph](/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph.md)

[Union Find](/overview/2.-data-structures/union-find.md)

* [Prim](/overview/3.-how-to-construct-algorithm-paradigm/mst-minimum-spanning-tree/prims-algorithm-undirected.md)
  * edge
* [Kruskal](/overview/3.-how-to-construct-algorithm-paradigm/mst-minimum-spanning-tree/kruskals-algorithm-undirected.md)
  * vertex

Reference

* <https://leetcode.com/tag/minimum-spanning-tree/>