pqueue
Priority queue implementations
Implementations of priority queues for Erlang, with varying trade-offs between speed and complexity.
Erlang Priority Queues
171 stars
10 watching
17 forks
Language: Erlang
last commit: over 1 year ago
Linked from 2 awesome lists
data-structureserlang
Related projects:
Repository | Description | Stars |
---|---|---|
| A JavaScript implementation of a priority queue data structure | 29 |
| Provides data structures and algorithms for efficient priority queuing in Haskell | 64 |
| A data structure implementation for managing elements of varying priorities in Swift | 372 |
| A library implementing a priority queue with multiple backends and flexible configuration options. | 11 |
| A data structure for efficiently managing items with priorities | 177 |
| Fast implementation of queue data structure | 51 |
| A C# implementation of a high-performance priority queue optimized for pathfinding applications. | 1,178 |
| A queue data structure implemented as a wrapper around the Elixir language's existing queue data type with additional features and improved API. | 34 |
| An Erlang implementation of a data structure optimized for efficient string-based key lookups and matching | 132 |
| An Erlang module providing efficient random number generation functions with proper seeding | 41 |
| An Erlang library providing in-memory size information for various term types without considering storage locations. | 33 |
| A data structure library implementing a B-heap priority queue optimized for cache performance and suitable for efficient insertion and retrieval of elements. | 104 |
| An Erlang module providing a 2-way map interface to handle identical values with different keys | 7 |
| A simple blocking unbounded queue implementation in Erlang | 8 |
| A tiny and efficient JavaScript implementation of a data structure providing fast and amortized O(1) access to queues and dequeues. | 112 |