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

Project Activity

See All Activity >

Categories

Algorithms, Genetic Algorithms

License

GNU General Public License version 3.0 (GPLv3)

Follow deapheap

deapheap Web Site

Other Useful Business Software
Enterprise-grade ITSM, for every business Icon
Enterprise-grade ITSM, for every business

Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.

Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
Try it Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of deapheap!

Additional Project Details

Intended Audience

Information Technology

Programming Language

Java

Related Categories

Java Algorithms, Java Genetic Algorithms

Registered

2015-02-19
Report inappropriate content