Greedy Algorithm is an algorithm design technique that choose locally optimal choice at each stage, or simply “take what you can get now”. It will produce not necessary an optimal solution but an approximate answer.
The following algorithms use this strategy to solve problems:
Prism’s Algorithm is a #202204151143 which is used to solve #202204272006. It is pretty much the same to 202204151059#. The update rule for the algorithm could be simplified to \(d_w = \text{min}(d_w, c_{w,v})\) after vertex \(v\) is selected for each unknown \(w\) adjacent vertices. \(d\) denoted the weight of the edge.
Kruskal’s Algorithm is an #202204151143 which used to solve the #202204272006. It uses Disjoint Set as its basic data structure and utilises the Union or Find algorithm.
Ford-Fulkerson Algorithm is a 202204151143# aim to solve #202206091105 by repeatedly finds augmenting paths through the 202206091605# and augments (updates) the flow until there is no 202206091601# to be found. It is essentially finding the bottlenecks, that is the smallest maximum capacity in the augmenting path, and sum them all together to get the maximum flow for the #202204112045. *
Dijkstra’s Algorithm is a #202204151143 to find the #shortest path for weighted graph.