A minimum spanning tree is a spanning tree with the smallest total edge weight.
What Is Minimum Spanning Tree?
A minimum spanning tree is a spanning tree with the smallest total edge weight.
Examples of Minimum Spanning Tree
1
Kruskal’s algorithm finds an MST for a weighted network.Formula and Key Points
Formula / rule
Minimize Σ edge weights
- Know the definition and standard notation for Minimum Spanning Tree.
- Be able to recognise or compute minimum spanning tree in a small example.
- Connect the concept to nearby topics in the same subject before using it in larger CSE problems.
Why This Matters in Computer Science
Used in networks, routing, dependency graphs, compilers, social networks, file systems and graph algorithms. Used to design low-cost communication, road or cable networks.
Related Math Terms
Minimum Spanning Tree: Frequently Asked Questions
What is Minimum Spanning Tree?
A minimum spanning tree is a spanning tree with the smallest total edge weight.
Why is Minimum Spanning Tree useful in computer science?
Used in networks, routing, dependency graphs, compilers, social networks, file systems and graph algorithms. Used to design low-cost communication, road or cable networks.