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 to Build on Google Cloud Icon
$300 Free Credits to Build on Google Cloud

New to Google Cloud? Get $300 in credits to explore Compute Engine, BigQuery, Cloud Run, Gemini Enterprise Agent Platform, and more.

Start your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
Claim $300 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