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
$300 Free Credits for Your Google Cloud Projects Icon
$300 Free Credits for Your Google Cloud Projects

Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
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