Minimal Spanning Tree

Kruskal vs Prim — animated MST construction on random graphs

MST cost:  |  Edges in MST:  |  Algorithm:
Cut property: the min-weight edge crossing any cut belongs to the MST. Cycle property: the max-weight edge in any cycle does NOT belong to the MST.