priority-queue
Priority queue
A data structure for efficiently managing items with priorities
A priority queue for Rust with efficient change function.
177 stars
7 watching
29 forks
Language: Rust
last commit: 5 months ago
Linked from 1 awesome list
data-structuresheapheap-algorithmmin-max-heappriority-queue
rust-unofficial/awesome-rustRelated projects:
| Repository | Description | Stars |
|---|---|---|
 davecom/swiftpriorityqueue | A data structure implementation for managing elements of varying priorities in Swift | 372 |
 strd6/priority_queue | A JavaScript implementation of a priority queue data structure | 29 |
 rollbear/prio_queue | A data structure library implementing a B-heap priority queue optimized for cache performance and suitable for efficient insertion and retrieval of elements. | 104 |
 okeuday/pqueue | Implementations of priority queues for Erlang, with varying trade-offs between speed and complexity. | 171 |
 jaspervdj/psqueues | Provides data structures and algorithms for efficient priority queuing in Haskell | 64 |
 falood/queuex | A library implementing a priority queue with multiple backends and flexible configuration options. | 11 |
 blueraja/high-speed-priority-queue-for-c-sharp | A C# implementation of a high-performance priority queue optimized for pathfinding applications. | 1,178 |
 takscape/elixir-heapq | A priority queue implementation in Elixir using a heap data structure. | 8 |
 princemaple/elixir-queue | A queue data structure implemented as a wrapper around the Elixir language's existing queue data type with additional features and improved API. | 34 |
 sczyh30/vertx-kue | A priority task queue built on top of Vert.x and backed by Redis. | 139 |
 qiao/heap.js | A binary heap data structure implementation in CoffeeScript/JavaScript for efficient priority management | 126 |
 adrianbrad/queue | Thread-safe, generic implementations of queue data structures in Go | 276 |
 rusty-celery/rusty-celery | An implementation of the Celery task queue system in Rust | 786 |
 igr/jrsmq | A Java implementation of a lightweight message queue that uses Redis as the underlying data store | 36 |
 fredwu/opq | A simple, in-memory queue with worker pooling and rate limiting. | 266 |