Found 81 packages
An attempt to create a priprity queue using minheap
A highly optimized Priority Queue for path-finding and related applications
A thread-safe generic first in-first out (FIFO) collection with support for priority queuing.
A fast generic PriorityQueue data structure .NET
C# implementation of generic heap-based concurrent priority queue for .NET
JS Priority Queue (js-priority-queue) binding library for Bridge.NET projects.
A simple and super efficient priority queue
Port of https://github.com/masterjeef/rapid-priority-queue for netstandard4.1
A simple and quick C# priority queue
PriorityStorageQueueReader is a priority based reader message reader for Azure Queue that supports great multi-threading processing capability A single reader may read form multiple queues within the same storage account and process on multiple handlers new PriorityStorageQueueReader(cnn , new QueueMessageReceiveHandler(1, "999-test1", OnNext) , new QueueMessageReceiveHandler(2, "999-test2", OnNext) , new QueueMessageReceiveHandler(3, "999-test3", OnNext) )) q: info@antonioesposito.it
Top-quality toolkit of algorithms and data structures for .NET developers.
An Azure Storage Queue wrapper that supports priorities and abstracts exponential backoff polling away with an event-driven interface
Algorithm and data-structure library for .NET 4.5.2+ / Netstandard 2.0+. Algorithmia contains sophisticated algorithms and data-structures like graphs, priority queues, command, undo-redo and more. Algorithmia is one of the pillars of LLBLGen Pro and is used in production successfully since May 2010. Many of the classes and algorithms in Algorithmia contain references to papers and articles on Wikipedia or other websites where you can find additional information regarding the algorithm or data-structure implemented. The core design of Algorithmia is about making algorithms and data-structures which are known for many years available to the .NET developer in easy to use and properly documented classes and methods. No class or method implemented in Algorithmia re-implements a .NET BCL (base class library) class or method unless it was necessary to do so (e.g. the linked list in .NET is re-implemented as it doesn't have an O(1) concat operation, which is necessary for the Fibonacci heap).
Videogame cross-platform framework for Windows, MacOS, Linux, WEB, Android(soon), IOS(soon).
A high-performance, thread-safe priority queue for .NET 10 that guarantees uniqueness of items. Ideal for scheduling, task management, and scenarios where duplicate entries must be avoided.
A concurrent priority queue with parallelism.
Fast and efficient implementation of a Priority Queue.
Efficient binary heap and Fibonacci heap implementation
A simple class that helps create a thread safe queue with priority.