Minimum Spanning Tree
Domain: Algorithms
🎯 Motivation
The cheapest way to connect all nodes in a weighted graph with no cycles. The backbone of network design.
📋 Concrete Example
Connect 5 offices with minimum total cable length. The MST gives the cheapest set of cables that connects all offices with no redundant loops.
🔗 Analogy
Connecting all classrooms in a school to the internet with the least amount of cable. You want every room connected, no loops (waste), and minimum total cable.