search
Found 510 packages
pkg
LogicBuilder.Structures✓
LogicBuilder.Structures includes classes used by multiple components in the LogicBuilder data stack.
v7.1.0
↙ 5.1M / total
logicbuilder
System.Linq.Queryable✓
Provides classes for querying data structures that implement IQueryable<T>. Commonly Used Types: System.Linq.Queryable System.Linq.EnumerableQuery<T> System.Linq.EnumerableQuery When using NuGet 3.x this package requires at least version 3.4.
v4.3.0
↙ 665.6M / total
Akka.DistributedData✓
Replicated data using CRDT structures
v1.5.62
↙ 3.3M / total
akkaactorsactormodelAkka
Akka.DistributedData.LightningDB✓
Replicated data using CRDT structures
v1.5.62
↙ 2.7M / total
akkaactorsactormodelAkka
pkg
QuickGraph
QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net, Silverlight, Windows Phone and Win 8. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc...
v3.6.61119.7
↙ 4.1M / total
algorithmsgraphdirectedundirecteddfs
pkg
VDS.Common
A library containing useful data structures like Trees, Tries, Sparse Arrays, Bloom Filters and indexing tailored dictionaries.
v3.0.0
↙ 2.6M / total
DataStructuresTreeTrieBinary
Deedle
Deedle implements an efficient and robust frame and series data structures for manipulating with structured data. It supports handling of missing values, aggregations, grouping, joining, statistical functions and more. For frames and series with ordered indices (such as time series), automatic alignment is also available.
v3.0.0
↙ 2.3M / total
F#fsharpdeedledataframeseries
pkg
BeeHive.DataStructures
A Reactive Cloud Actor library/mini-framework
v3.0.1
↙ 108.4K / total
Apache.Avro
Avro provides: Rich data structures. A compact, fast, binary data format. A container file, to store persistent data. Remote procedure call (RPC). Simple integration with dynamic languages. Code generation is not required to read or write data files nor to use or implement RPC protocols. Code generation as an optional optimization, only worth implementing for statically typed languages.
v1.12.1
↙ 52.2M / total
AvroApacheSerializationBinaryJson
Redpoint.Git.Abstractions✓
Provides common abstractions for Git data structures. The other Redpoint.Git.* libraries implement these interfaces.
v2026.1054.500
↙ 245.1K / total
gitabstractionsdatastructures
NuGet.Packaging.Core✓
The (former home to) core data structures for NuGet.Packaging. Contains only the type forwarders to the new assembly.
v6.9.1
↙ 22.9M / total
nuget
Mars.Life.Simulations
MARS LIFE is a modelling framework for agent-based simulations. It provides the following features: * Agent definitions * Layer definitions * Integration of GIS spatial data like raster-files (*.asc, *.geotiff) and vector formats (*.shp, *.geojson, *.kml, *.gml) * Representations for temporal data with optional spatial reference (spatiotemporal) * Spatial data-structures and agent-environments for movement and explorations * Methods and algorithms for numerical computations for every day use * Result output-pipeline and simulation result persistence For more details how to use MARS, please use the documentation: https://www.mars-group.org/docs/tutorial/intro
v5.3.1
↙ 1.2M / total
numericsimulationagentgisdata
pkg
ConcurrentDataStructures
C# implementations of thread-safe PriorityQueue and SkipList for .NET
v0.2.0
↙ 39.6K / total
SkipListPriorityQueueHeapConcurrentCollection
pkg
BlazorDatasheet.DataStructures
Geometry, R-tree, interval, sparse store, and graph data structures used by BlazorDatasheet.
v0.9.5
↙ 28.7K / total
blazordatasheet
pkg
MoreComplexDataStructures
MoreComplexDataStructures is a class library containing a collection of data structures (plus related utility classes) more complex than those found in the standard .NET framework. The project currently contains the following data structures and utility classes... WeightBalancedTree<T> - A weight-balanced binary search tree MinHeap<T> - A tree-based min heap MaxHeap<T> - A tree-based max heap PriorityQueue<T> - A tree-based double-ended priority queue Trie<T> - A trie (or prefix tree) CharacterTrie - A trie which stores characters (with some performance enhancements over Trie<Char>) WeightedRandomGenerator<T> - A weighted random number (or item) generator UniqueRandomGenerator - A random number generator guaranteed to always produce unique numbers within a given range FrequencyTable<T> - A frequency table LRUCache<TKey, TValue> - A simple least recently used cache UnflaggedNumberGenerator - Allows the 'flagging' (marking) of numbers in a specified range, and provides methods to identify numbers which were not flagged LongIntegerStatusStorer - Stores a boolean status for a complete set of long integers ListRandomizer - Randomizes the elements of a list using the Fisher/Yates/Knuth algorithm
v1.9.2
↙ 24.5K / total
datastructureweightweightedbalanced
masbicudo.data.structures
MASBicudo Data Structures - Immutables, Continuous.
v1.2.2
↙ 10.8K / total
datastructuresimmutabletreecontinuous
pkg
WoWsShipBuilder.DataStructures
The data structures used to store gamedata required for the ShipBuilder application.
v6.1.0
↙ 38.2K / total
pkg
DigitalSkynet.DotnetCore.DataStructures
Core data structures
v8.0.12
↙ 28.8K / total
pkg
SD.Tools.Algorithmia✓
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).
v1.4.0
↙ 479.2K / total
AlgorithmDataStructureclasslibrary
pkg
ThomasCook.DataStructures
Description
v0.0.1.4
↙ 18.2K / total
page 1next →