22 packages tagged with “PriorityQueue”
The C5 Generic Collection Library for C# and CLI is a comprehensive collection library supporting lists, sets, bags, dictionaries, priority queues, (FIFO) queues, and (LIFO) stacks. C5 runs on everything supporting .NET Standard 2.0: .NET Core 2.0+, .NET 4.6.1+, Mono, Xamarin, Universal Windows Platform, and Unity.
This are C# class libraries that implements generic collections that are not covered by the .NET base class library. At the moment this is just a BinaryHeap implementation with various variations, and based on that an implementation of a PriorityQueue.
a library with concurrent collections
C# implementation of generic heap-based concurrent priority queue for .NET
C# implementations of thread-safe PriorityQueue and SkipList for .NET
Port of https://github.com/masterjeef/rapid-priority-queue for netstandard4.1
Welcome to Academy Collections. Academy.Collections presents a new set of data structures offering a lot of new applications for storing data in memory performing optimized operations and guaranteeing Microsoft .NET features like serialization and data information when debugging. Academy.Collections 2.0 reinvented its presentation patterns in order to bring you the easiest interaction with all its new features. This project is part of Academy Works.
A fast generic PriorityQueue data structure .NET
A number of helpful collections, such as a DropOffStack, a PriorityQueue, some binary-search types that allow chop-searching on virtual collections (not just on an array), and a grab-bag of additional types such as: A ConcurrentTasksRunner, a GuidTimeStamp, a Colour type, and so forth.
Simple C# Priorityqueue implementation
Package Description
NCommons is a set of several .NET libraries which provide common building blocks that can be used by any kind of library or application. This library provides several generic and specialized collection-type members. Commonly Used Types: IPriorityQueue<T> PriorityQueue<T> Heap<T> BinaryHeap<T> INotifyCollectionChanging PreviewingObservableCollection<T> WeakReferenceCollection<T> You can find additional information and documentation on the library's GitHub page: https://github.com/manuelroemer/NCommons
DataStructures for graphs, vertices,edges,nodes and trees. Contains a Binary Search Tree, AVL Tree and a PriorityQueue based on BST Tree which can handle duplicates
A free to use library as wrapper around the HttpClient to use as a download manager or as easy producer consumer implementation. All Requests will be handled by an PriorityQueue in a parallel state to have a simple and efficient way to handle many Requests. Tested with more than 1000 HttpRequests. Also includes retry, priority and cancel function. Classes: • StatusRequest: Calls a Head request and returns a response message with the headers. • OwnRequest: Wrapper around your own requests. Easy to self-expand function. • SiteRequest: Scans a website for all references. • LoadRequest: To download the response into a file. o This is a HTTP file downloader with pause and resuming function. Returns an IProgress to get the download progress.
Fast and efficient implementation of a Priority Queue.
Collection of useful classes for your .NET application: Object Pool, Thread Pool, Queue Async Processor, BlockingQueue, DiskQueue, ThreadSetManager, Throttling, Semaphore, EntryCounteringEvent, Collections, ReadOnlyCollections, IoC, WeakEvent and other.
Extends the standard library with: - Async lazy (PublicationOnly and ExecutionAndPublication thread safety modes). - Sync and async in-memory value cache. - Sync and async in-memory key-value cache. - Min and max priority queues. - Argument validation methods. - Extension methods for collection interfaces. - Extension methods for standard library types like int, string, DateTime.
Advanced data structures for .NET
A Keyed PriorityQueue that allows you to Queue method execution based on different priorities with keys. So each key has its own priority.