-
Comment on the algo you want to do and go ahead. No need to be assigned. Send pr. But comment the algo you are doing ,to make sure no duplication. One algo at a time.
-
https://github.com/prof-erik/cisc4080/blob/012cc97a8742edb5a9883bdf18aa4b1ed6dec3d4/set_cover.cpp#L19-L20
What's the difference between these two maps? Is covering_vertex_status a boolean map that…
-
- [ ] Code should be of greedy algorithms related.
- [ ] Code should be clean and well commented
- [ ] File should be in the format mentioned in README.md and your name should be their in the co…
-
mstou updated
4 years ago
-
In the Greedy Algorithms section, coin change problem is provided as an example. This creates an impression that every coin change problem can be solved with greedy approach. This is incorrect since u…
-
-
This repo also requires a section of greedy algorithms.
-
Hey, probably you missed this
(if (> (reward vstar) (reward g) vsar g))
it should be the following :)
(if (> (reward vstar) (reward g)) vstar g)
-
So far, there is Greedy and A* to solve the puzzle.
Would be nice to add further algorithms.
-
**This is a(n):**
- [ ] New algorithm
- [x] Update to an existing algorithm
- [ ] Error
- [ ] Proposal to the Repository
**Details:**
Adding dijkstra_shortest_path using greedy-algorithms in…