Kruskal Minimum Spanning Tree: Mental Model

Start with the idea

Begin with the concrete question: Return the MST edge weights in chosen order. For the visible input edges=0-1:1,0-2:4,1-2:2,1-3:5,2-3:3, the stated result is 1,2,3. Before reading code, name the smallest piece of information that must survive from one step to the next. Edge weights change what a path means. State whether the objective is minimum distance, a spanning structure, or feasible flow before choosing state. That is the mental model for Kruskal Minimum Spanning Tree; it gives you a reason for each update instead of a line of code to memorise.

The core mechanism is this: Sort edges and add one only when union-find says it joins different components. Treat it as a claim to test after every operation. Write down the state before the first operation, update it once, and ask which part of the claim is still true. If an item is skipped, inserted, or removed, explain why that action cannot destroy an answer that should be retained. A useful trace has columns for the current input position, the state before the step, the action, and the state afterward. Use the visible sample until the expected result becomes inevitable rather than merely plausible.

Now inspect the Rust sketch, not just its final expression. The supplied Rust sketch is an invariant note rather than a complete program. Turn it into explicit state and transitions before coding.