Skip to content
#

indexed-priority-queue

Here are 2 public repositories matching this topic...

Language: All
Filter by language

A high-performance priority queue (supporting either a minimum or maximum priority, depending on the comparison function) implemented as a binary heap with optimized key-modification operations ("decrease" and "increase"); it is based on the TIPQ class developed by Rassim Eminli. (http://c-evo.org/files/download.php?remi.remi.zip)

  • Updated Oct 30, 2026
  • C#

Add this topic to your repo

To associate your repository with the indexed-priority-queue topic, visit your repo's landing page and select "manage topics."

Learn more