Greedy Algorithms about acm-icpc-algorithms HOT 5 CLOSED

Greedy Algorithms like Kruskal’s Minimum Spanning Tree Algorithm

from acm-icpc-algorithms.

Any other ones I could implement here? Dijkstra's, Prim's? I'm new to contributing to open source so I'd love to start with this!

from acm-icpc-algorithms.

Any would be great! Also try Dial’s Algorithm.

from acm-icpc-algorithms.

Create a new issue to fix this confusion.

from acm-icpc-algorithms.

@96mohitm @crunchcrackle I think algos such as MST or Dijskstra, prim are under the category of graph algorithms.
@matthewsamuel95 may be greedy methods can be other cases of the remaining category, you may need to label it out someway? In my opinion greedy is simply a concept.

from acm-icpc-algorithms.