37 packages returned for Tags:"heap"

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... More information

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... More information

C# implementations of thread-safe PriorityQueue and SkipList for .NET

C# implementation of generic heap-based concurrent priority queue for .NET

Priority queue, reversible dictionary, reversible sorted dictionary, dynamic multidimensional array, heap, heapsort etc.

A generic heap datastructure, that satisfies the "heapify" algorithm. A MicroLibrary is a "class library" that is added directly into your own project, instead of being added as a separate reference.

The framework core part.

A fast generic PriorityQueue data structure .NET

A MemoryStream replacement that avoids using the Large Object Heap

Top-quality toolkit of algorithms and data structures for .NET developers.

A simple and super efficient priority queue

The framework core part.

Hash based folder structure used for storing a large number of files

Binary heap with an API similar to Python's heapq module

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... More information

Package Description

NFX CORE Package NFX UNISTACK includes: Application Container + Dependency Injection facilities Configuration engine BigMemory: Local/Distributed piles/heaps, ability to store hundreds of millions... More information

ADN.DataStructures is a cross-platform open-source library which provides data structures utilities to .NET developers

Fully managed library providing five types of heap. It implements d-ary, binary, binomial, Fibonacci and pairing heaps, in order to let the user choose the best heap to fit her/his needs. Each heap has its own... More information

A fast generic PriorityQueue data structure .NET