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)
c-sharp priority-queue c-sharp-learning indexed-priority-queue c-sharp-games integer-indexed-priority-queue
-
Updated
Oct 30, 2026 - C#