11 packages tagged with “data-structure”
A data structure which allows fast random selection of items
CodeJam is a set of handy reusable .NET components that can simplify your daily work and save your time when you copy and paste your favorite helper methods and classes from one project to another.
Trie (a.k.a. prefix tree) is an ordered tree data structure that is used to store an associative array where the keys are usually strings. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string.
An implementation of a discriminated union data structure with pattern matching support.
A simple fixed size cache data structure for .NET.
Binary heap with an API similar to Python's heapq module
Package provides C# implementation of algorithms in the "Algorithms" book (http://algs4.cs.princeton.edu/home/) and Robert Sedgwick's Algorithms course using Python (Part I and Part II), covering data structure, sorting, search, graph processing, string processing.
Package Description
HeapQueue is a generic priority queue implementation that uses a binary heap.
A data structure that's both a queue and a stack.
A high-performance XOR filter implementation for .NET providing fast membership testing with low false positive rates and memory efficiency. Now with zero-allocation ReadOnlySpan<byte> API.