Results for heap_queue

a simple priority queue base on heap

Library for using heap-queue with ts

More powerful alternative to `std::collections::BinaryHeap`

A Priority Queue implemented as a heap with a function to efficiently change the priority of an item.

A (fast) implementation of pairing heap data structure for priority queue and some graph algorithms

Generic d-ary heap priority queue supporting min/max via comparator, with O(1) item lookup for updates. Features configurable arity, efficient priority updates, and cross-language API compatibility.

Priority queue traits and high performance d-ary heap implementations.

Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps. Makes some previously internal function public

A simple priority queue implemented as a heap stored in a Vec

Heap/Priority Queue implementations

Priority queue that support changing priority or early remove by key

A Rust library for finding shortest paths in weighted graphs using Dijkstra's algorithm with multiple heap implementations

A SIMD-accelerated priority queue

Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps.