Kruskal's Algorithm
Kruskal builds a minimum spanning tree by sorting edges by weight and taking the next cheapest edge that does not create a cycle.
先从这个心智模型开始
Kruskal builds a minimum spanning tree by sorting edges by weight and taking the next cheapest edge that does not create a cycle.
它如何工作，不堆砌不必要的术语
Sort edges ascending.
Use Union-Find to test whether the two endpoints are already connected; if not, add the edge and union the components.
把算法读成一连串决策
Define directed/undirected and weighted/unweighted assumptions.
Choose the graph representation.
Track algorithm state and handle disconnected/cyclic cases explicitly.
Read a tiny input by hand and write down the state after every important operation. For Kruskal's Algorithm, the goal is to make the invariant visible rather than to memorize code.
O(E log E)
Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.
适用场景
- Use the algorithm only when its graph assumptions match the problem.
通常哪里会出错
- Forgetting disconnected components.
- Mixing weighted and unweighted shortest-path algorithms.
- Not protecting against revisits/cycles.
专业回答结构
Connect Kruskal to Union-Find. The sorting step dominates, typically O(E log E).
What problem does Kruskal's Algorithm solve?
Kruskal builds a minimum spanning tree by sorting edges by weight and taking the next cheapest edge that does not create a cycle.
关于复杂度应该提到什么？
Its typical cost here is O(E log E), but a complete answer should connect that cost to the representation, input constraints and the dominant operations.
最常见的错误是什么？
Forgetting disconnected components.