A deap is a doubly priority queue for efficient data operations. Both insertion and deletion operations take O(log(N)) time. Access of min or max takes constant time. It can be useful when both min and max are needed in the queue. It can also be used in situations where the number of items is too large and items with low priorities can be dropped with keep memory footprint small.
Features
- data structure
- doubly priority queue
- deap
- heap
License
GNU General Public License version 3.0 (GPLv3)Follow deapheap
Other Useful Business Software
Paessler: Easy to Use With Enterprise Power. Free Trial
You shouldn't have to choose between a monitoring tool that's easy to use and one that's powerful enough for a complex environment. PRTG's low-code interface lets any admin build dashboards, set alerts and monitor devices without scripting, while custom sensors and full API access are there when your team needs deeper control. One platform, no compromise. Download a free 30-day trial now.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of deapheap!