🔥 greedy algorithm → As a canonical instance, Kruskal’s procedure—sorting edges by weight, adding the lightest non-cycling edge, and using union-find—operationalizes the greedy-choice property and optimal substructure, thereby enabling and grounding the broader greedy_algorithm paradigm.

🌟 minimum spanning tree →

⭐️ prim algorithm →

⭐️ boruvka algorithm →

⚡️ dijkstra algorithm →

⚡️ maximum spanning tree →