Graph structure, traversal and related algorithms. Provides: GraphSet<T> GraphNode<T> GraphSetExtensions GraphNodeComparer
Structural answer engine for C# codebases. Answers agent questions about call paths, interface implementations and change blast radius under a hard token budget.
Structural answer engine for C# codebases. Answers agent questions about call paths, interface implementations and change blast radius under a hard token budget.
Virtual Society Graph Infrastructure is used for, storing, querying and loading complex synthesized data and its structure for its simulations.
Structural answer engine for C# codebases. Answers agent questions about call paths, interface implementations and change blast radius under a hard token budget.
Structural answer engine for C# codebases. Answers agent questions about call paths, interface implementations and change blast radius under a hard token budget.
Structural answer engine for C# codebases. Answers agent questions about call paths, interface implementations and change blast radius under a hard token budget.
Structural answer engine for C# codebases. Answers agent questions about call paths, interface implementations and change blast radius under a hard token budget.
A graph data structure efficient for large sparse graph representation written in F#
Public TinyRustLM .NET SDK for UAIX.org .uai AI memory packages, AI Memory Package Wizard workflows, discoverable setup catalog, embedded AI digest adoption, point-agent setup URLs, prompt nudges, Safe Structured Output review boundaries, review/export checks, Codex/Claude/GPT agent-use blocks, DTMI policy, family-aware required files, file handoff, LLM Wiki memory layouts, multi-agent communication records, Talisman System anchor-governance review records, and advanced persona personality-pack validation. It plans required files including agent-pickup.uai, session-log.uai, manifest JSON, manifest overlay, package model, knowledge graph, llms.uai, and llms-full.uai exports; inspects .uai folders, .zip and .uaix archives without extraction; inspects memory manifest JSON; and reports advanced persona .uaix, ZIP, and TXT deck expectations plus dimension evidence for depth_level_0_to_10, disclosure boundaries, source confidence, triggered style axes, and non-inference rules for TinyRustLM runtime consumers. This package backs the UAIX.Browser.Memory local feed identity while keeping hosted import validation, automatic repository writes, automatic LLM Wiki sync, persona-fidelity certification, memory ranking, and private optimization logic out of the package.
Object-first ship design model: ShipDesign graph with per-object CadDocument construction, structure factory, and cutout relationships.
A .NET standard library containing primitive graph structures and algorithms
A graph manipulation library for .NET: directed/undirected, weighted (generic math), multigraphs, DAG-enforcing and dense matrix-backed graphs, plus hypergraphs — with traversals, cycle detection, topological sort, connectivity/SCC, shortest paths (Dijkstra, Bellman-Ford, Floyd-Warshall, A*), minimum spanning trees (Kruskal, Prim), and structural queries.
Contains or extends useful data structures and graph traversal algorithms that are not part of .NET
Structural answer engine for C# codebases. Answers agent questions about call paths, interface implementations and change blast radius under a hard token budget.
Developer-facing CLI for IoCTools: fields, services, explain, graph, why, doctor, compare, profile, config-audit, evidence, test scaffold, fixture evidence, validators, validator-graph, and structured suppression output.
HNSW provides a high-performance, approximate nearest-neighbor search solution using the HNSW data structure. It supports custom distance metrics, efficient searching with concurrency, and configurable parameters to balance speed, recall, and memory usage. Perfect for .NET applications that require fast similarity lookups (e.g., image retrieval, recommendation systems, or vector-based search).
Temporary package to address assembly reference issues in QuikGraph.MSAGL .NET library that provides a bridge from QuikGraph graphs to MSAGL library. This package is the MSAGL subset of the original QuickGraph renamed QuikGraph and ported to .NET Core. Supported platforms: - .NET Standard 2.0+ - .NET Core 2.0+ - .NET Framework 4.6.1+ Supports Source Link
Virtual Society Graph Infrastructure is used for, storing, querying and loading complex synthesized data and its structure for its simulations.
StructRAG implementation for SimpleModule. Converts retrieved documents into optimal structured formats (tables, graphs, algorithms, catalogues) before reasoning.
Generic tree data structure with traversal, serialization, subtree mutation, lowest common ancestor, and flat-to-tree conversion.
.NET library that provides a bridge from QuikGraph graphs structures to Graphviz and Dot language serialization. This package is the Graphviz subset of the original QuickGraph renamed QuikGraph and ported to .NET Core. Supported platforms: - .NET Standard 1.3+ - .NET Core 1.0+ - .NET Framework 3.5+ - .NET Core 5.0 - .NET Framework 4.8 Supports Source Link Original from: https://github.com/KeRNeLith/QuikGraph
The gated, on-demand companion to the AngelSix.ContextMap on-build package. Opens a .NET solution with Roslyn and writes a full context map including the in-solution call graph (who calls what) into AgentDocumentation/ContextMap, the evidence behind a context map's "touch X also touch Y" impact guidance. Slower than the on-build structural pass, so it is run on demand, not every build.
.NET library that provides convenient graph helpers related to DataTable (and also serialization to Graphviz). This package is a subset related to DataTable of the original QuickGraph renamed QuikGraph and ported to .NET Core. Supported platforms: - .NET Standard 2.0+ - .NET Core 2.0+ - .NET Framework 3.5+ - .NET Core 5.0 - .NET Framework 4.8 Supports Source Link Original from: https://github.com/KeRNeLith/QuikGraph
.NET library that provides some Petri Net facilities. It allows to construct Petri Net representation and run a simulation of it. This package is the Petri subset of the original QuickGraph renamed QuikGraph and ported to .NET Core. Supported platforms: - .NET Standard 1.3+ - .NET Core 1.0+ - .NET Framework 3.5+ - .NET Core 5.0 - .NET Framework 4.8 Supports Source Link Original from: https://github.com/KeRNeLith/QuikGraph
.NET library that provides a bridge from QuikGraph graphs to MSAGL library. This package is the MSAGL subset of the original QuickGraph renamed QuikGraph and ported to .NET Core. Supported platforms: - .NET Standard 2.0+ - .NET Core 2.0+ - .NET Framework 4.6.1+ - .NET Core 5.0 - .NET Framework 4.8 Supports Source Link Original from: https://github.com/KeRNeLith/QuikGraph
.NET library that provides serialization features related to QuikGraph data structures. This package is the serialization subset of the original QuickGraph renamed QuikGraph and ported to .NET Core. Supported platforms: - .NET Standard 1.3+ - .NET Core 1.0+ - .NET Framework 3.5+ - .NET Core 5.0 - .NET Framework 4.8 Supports Source Link Original from: https://github.com/KeRNeLith/QuikGraph
DTree (part of Triordinal): incremental encoding of the topology of directed trees by two projections (Q1, Q2): O(1) reachability, and/or queries on the topology of the tree, dynamic (incremental) updates.
A high-performance directed graph library for .NET 8. Provides data structures and algorithms for dependency analysis, topological sorting, cycle detection, strongly connected components (SCC), weakly connected components (WCC), path finding, and graph slicing.
DTree: incremental encoding of the topology of directed trees by two projections (Q1, Q2): O(1) reachability, and/or queries on the topology of the tree, dynamic (incremental) updates.
On-build code context maps for .NET. After every successful build it reads the built assemblies and writes a deterministic structural map (project graph, types, interface implementers, base types, and the public and internal member surface) plus a compact digest into AgentDocumentation/ContextMap, so cheaper or local AI models can navigate a codebase without re-deriving it. Build-only and non-fatal; reads finished assemblies, never opens an MSBuild workspace.
A library to use Graph implementations and their algorithms
Advanced and complementary data structures for modern .NET. Includes DoublyLinkedList, SortedList, PriorityQueue, Deque, PriorityStack, BinarySearchTree, and Graph implementations.
FlowLite is a high-performance, thread-safe, and developer-friendly finite state machine (FSM) library for .NET. It helps you manage entity state transitions, workflow automation, and domain-driven state logic in a structured and testable way. Features: fluent API for state and trigger configuration, async support for transition logic, export as Mermaid.js or DOT graph, built-in JSON and in-memory storage.
Get your bearings in a .NET codebase. Bearing reads a solution and reports a map of the system and a short list of the components that are unusual for what they are — relative to their structural peers, never as a score.
Core types and interfaces for RTHDDNetComposer - a high-performance neural network compositor with C# graph construction and C++ runtime execution. Includes node types, graph structures, and memory-mapped communication primitives.
Graph visualization and diagnostics for RTHDDNetComposer. Provides DOT/GraphViz export, Markdown reports, structured text views, and diagnostic utilities for computational graph introspection.
An Avalonia canvas control for rendering structured diagrams with colorized labeled entities, connectors with configurable endpoints, a graph-paper grid background, drag-and-drop, hit testing, and arbitrary metadata support.
Includes: - Data Structure Conversion - Shorthand For Loops - Graph Algorithms - The Option Type - Random Element Extension Method
A zero-dependency, deterministic toolkit of classic (non-neural, CPU-only) pattern-discovery and data-mining algorithms for .NET: frequent itemsets and association rules, sequential and episode mining, process mining, clustering, anomaly detection, graph mining, causal-structure tests, time-series motifs, and more. Speak in your own labels through the fluent on-ramp; the integer encoding the analyzers require is handled for you. Every algorithm is validated against planted-truth datasets.
Structured PII scanning add-on for RedactWire — detect PII inside JSON, XML and object graphs, each hit located by JSONPath / XPath / property path. Adds a System.Text.Json dependency; install only if you need structured scanning (the core RedactWire package stays free of it).
.NET library that provide mainly graphs structures and algorithms for C#. (Fork focused on tuning memory usage and GC pressure for certain use cases) QuikGraph provides generic directed/undirected graph data structures and algorithms for .NET. It comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, etc... This package is a version of the original QuickGraph renamed QuikGraph and ported to .NET Core. It should be seen as an alternative to the old frozen QuickGraph from CodePlex but with fixes. It does not include every sub modules of the original library such as F# stuff, adapters, etc. This build is only the Core of QuikGraph taking advantage of .NET Core. Supported platforms: - .NET Standard 1.3+ - .NET Core 1.0+ - .NET Framework 3.5+ Supports Source Link
Config-free codebase dependency viewer. Scans a TypeScript/Node project's source or a .NET project's built assemblies and emits one self-contained, runtime-free codebase-dsm.html with interactive Dependency-Structure-Matrix and Cytoscape graph tabs. Installed as the .NET tool lib.inspector-gadget; the CLI command is inspector-gadget.
A Result pattern (Result / Result<T>) that runs anywhere .NET does: one .NET Standard 2.0 assembly, verified on .NET Framework 4.8 and .NET 9, referenceable from .NET Framework 4.6.1+, .NET Core 2.0+, .NET 5-9+, Unity, Xamarin and MAUI. Zero dependencies and zero reflection, so it is trim- and Native AOT-safe and adds nothing to your dependency graph. Structured errors with stable codes, validation batching, ErrorType-to-HTTP-status mapping and pagination. Allocation-conscious: the success path measures 0 bytes per operation, and Result is a 24-byte struct.
Format-agnostic tensor graph IR, model definition and execution-provider abstractions, plus the task-level inference utilities on top of compiled models: LLM generation, sampling, serving, structured output, scoring and embeddings (Sharplight.Llm), tokenizers, Jinja chat templates, the model description (kind and components) and the task layer (text generation, speech recognition and synthesis, image generation) with audio and image I/O.
Yurai combines ordinary C# arithmetic over eagerly evaluated domain values with immutable, structurally shared derivation evidence and first-class dependency-path queries, in a zero-runtime-dependency netstandard2.0 library. Pre-1.0: public API may change.