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 >

License

GNU General Public License version 3.0 (GPLv3)

Follow deapheap

deapheap Web Site

Other Useful Business Software
Gen AI apps are built with MongoDB Atlas Icon
Gen AI apps are built with MongoDB Atlas

The database for AI-powered applications.

MongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
Start 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