# 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](https://algorithm.prettylog.com/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph "mention")

[union-find](https://algorithm.prettylog.com/overview/2.-data-structures/union-find "mention")

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

Reference

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