🔥 minimum spanning tree → MST algorithms (e.g., Kruskal and Prim) rely on greedy selection—choosing the locally optimal edge guided by cut/cycle properties—to construct the tree, so MST computation is enabled by the greedy paradigm.

🔥 kruskal algorithm → Kruskal relies on the greedy paradigm by repeatedly selecting the lightest edge that does not form a cycle; its design and correctness depend on greedy-choice and cut properties.

🔥 dijkstra algorithm → Dijkstra's algorithm applies the greedy-choice property by always expanding the minimum-current-distance unvisited vertex (via a priority queue); with non-negative edge weights, these local choices yield globally optimal shortest paths.

⚡️ huffman coding →

⚡️ boruvka algorithm →

⚡️ prim algorithm →