---
title: "#minimum-spanning-tree-mst articles | Hashnode"
description: "Explore 2 articles tagged #minimum-spanning-tree-mst on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/minimum-spanning-tree-mst"
---

Tag

# #minimum-spanning-tree-mst

2 posts · 0 followers

[MrHe](https://hashnode.com/@MrHe) · [Oct 3, 2025](https://hashnode.com/posts/minimum-spanning-tree-mst/68dfdf4d937c67cba0b916b5)

### [最小生成树（Minimum Spanning Tree, MST）](https://xiaoh.hashnode.dev/minimum-spanning-tree-mst?utm_source=hashnode&utm_medium=feed)

这玩意儿听起来挺唬人，但其实思想特别朴素。想象一下，现在有几个村庄，你要负责修路把它们都连起来，并且想花最少的钱。每条备选的路都有一个造价。你怎么设计这个路网，才能保证所有村庄都能互相到达，并且总造价最低？ 这就是最小生成树。给你一张带权重的无向图，找一棵能连接所有顶点的树，并且这棵树所有边的权重之和最小。 扯远了，拉回来。搞定这个问题，有两个经典的“骚操作”，一个叫Kruskal，一个叫Prim。这两个都是贪心算法，但贪心的角度不太一样。今天咱们把这俩都盘明白了。 准备工作：图怎么表示？ 在撸...

5 min read · [xiaoh.hashnode.dev](https://xiaoh.hashnode.dev/minimum-spanning-tree-mst?utm_source=hashnode&utm_medium=feed)

[Chetan Datta](https://hashnode.com/@chetan77) · [Sep 21, 2025](https://hashnode.com/posts/minimum-spanning-tree-mst-prims-algorithm/68d044107a337af3ea2be0b0)

### [Minimum Spanning Tree (MST) | Prims Algorithm](https://chetan77.hashnode.dev/minimum-spanning-tree-mst-prims-algorithm?utm_source=hashnode&utm_medium=feed)

Spanning Tree A tree in which we have N nodes and N-1 edges and all nodes are reachable from each other. Some of the possible Spannig trees Minimum Spanning Tree A spanning tree where the total sum of all the edges is the smallest possible is call...

3 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/minimum-spanning-tree-mst-prims-algorithm?utm_source=hashnode&utm_medium=feed)
