priority-queue
A Rust priority queue with efficient priority change operations, implemented using IndexMap and a heap of indexes.
What is priority-queue?
PriorityQueue is a Rust crate that provides a priority queue data structure with the unique ability to efficiently change the priority of existing elements. It is designed for scenarios where dynamic priority updates are required, offering performance advantages over standard binary heaps for such operations.
Rust developers working on systems that require dynamic priority updates, such as schedulers, network routing algorithms, or real-time simulations, as well as those targeting embedded or no_std environments.
Developers choose this over standard binary heaps because it allows modifying the priority of any element in O(log n) time, compared to O(n) for standard heaps, and offers additional features like double-ended support, custom hasher tuning, and no_std compatibility.
Overview
A priority queue for Rust with efficient change function.
Use Cases
Best For
- Implementing schedulers or task queues where task priorities need to be updated dynamically.
Related Projects
Found a gem we're missing?
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
