qbit86 

Abstractions of graphs to be examined and manipulated in a data-structure agnostic fashion. Commonly used types: • IHeadIncidence<TVertex, TEdge> • IOutEdgesIncidence<TVertex, TEdges> •... More information

Graph traversal algorithms: BFS, DFS. Commonly used types: • Adjacency.EnumerableBfs<TVertex, TNeighborEnumerator> • Adjacency.EnumerableDfs<TVertex, TNeighborEnumerator> •... More information

Basic blocks for building algorithms and data structures. Commonly used types: - Color - Endpoints<TVertex> - EqualityComparerEquatable<T, TComparer>

Data structures that provide a generic implementation of graph interfaces and collection concepts. Commonly used types: • AdditiveMonoid<T> • AdjacencyEnumerator<TVertex, TEdge, TGraph, TEdgeEnumerator> •... More information

Indexed collection like usual List<T>, but with less allocations. Enables reusing instances of inner array via ArrayPool<T>.Shared. Provides ToRist() extension method which perfectly replaces conventional... More information

Abstractions for Phlogopite library — structured logging for .NET with low memory footprint. Commonly used... More information

Default implementation of abstractions for Phlogopite library — structured logging for .NET with low memory footprint. Commonly used... More information

Text-based sinks for Phlogopite library — structured logging for .NET with low memory footprint. Commonly used types: Phlogopite.Formatter Phlogopite.IFormatter<TProperty> Phlogopite.Range

Minimalistic state machine. Commonly used types: • IState<TContext, TEvent, TState> • StateMachine<TContext, TEvent, TState> • IAsyncState<TContext, TEvent, TState> • AsyncStateMachine<TContext, TEvent,... More information

Console logger for Phlogopite library — structured logging for .NET with low memory footprint. Commonly used types: Phlogopite.ConsoleLogger Phlogopite.ConsoleLoggerBuilder

A thin wrapper around System.DateTime which guarantees Kind to be Utc. Commonly used types: Instantia.UtcDateTime

Associative collection like usual Dictionary<TKey, TValue>, but with comparer type preserved instead of hiding behind the interface. Enables devirtualization of calls to the key comparer. Enables reusing... More information

Basic blocks for building algorithms and data structures. Commonly used types: • Int32ColorDictionary • Int32Dictionary<TValue, TValueList> • Int32ReadOnlyDictionary<TValue, TValueList> • Int32Set

Special graph data structures that provide efficient implementation when vertices are integers from a contiguous range. Commonly used types: • Int32AdjacencyGraph • Int32IncidenceGraph

Graph traversal algorithms specialized for integer vertices from a contiguous range. Commonly used types: • Adjacency.EnumerableBfs<TNeighborEnumerator> • Adjacency.EnumerableDfs<TNeighborEnumerator> •... More information

Graph search algorithms: Dijkstra. Commonly used types: - Adjacency.AdditiveEnumerableDijkstra<TVertex, TWeight> - Adjacency.AdditiveEnumerableDijkstra<TVertex, TNeighborEnumerator, TWeight> -... More information