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.