### From Progteam

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Given a graph with weighted edges, that graph's **Minimum Spanning Tree** is the tree that connects every vertex in the graph, such that the sum of the weights of the edges is minimal.