KnowraGreedy algorithmLinked fromLinked fromThe 19 pages that link to Greedy algorithm, each with the reason it gives.All 19Broader topic 1Related 7Narrower topic 4Compared with 7Dijkstra's algorithmNarrower topic: Finalizing the nearest unsettled vertex is Dijkstra's greedy choice.Huffman codingNarrower topic: Huffman construction repeatedly merges the two least frequent nodes.Egyptian fractionNarrower topic: The standard Egyptian fraction construction is one instance of this broader algorithmic strategy.Kruskal's algorithmNarrower topic: Kruskal's algorithm chooses the lightest currently eligible edge at each step.