Search


Mutable Priority Queue Container
starstarstarstarstar
When dealing with functional minimization, or maximization, it can sometimes be solved by a greedy algorithm. To implement greedy algorithm one needs priority queue container, i.e. get for a very low cost the lowest or highest element present in a sorted [...]


Sort results by

Refine the search results

Keywords

Authors

main_flat
ISSN 2327-770X
Powered by Midas