Note: this package contains Standard edition assemblies; for Professional edition, install 'MindFusion.Diagramming' package. MindFusion.Diagramming adds to applications the ability to create and present flowchart and process diagrams, workflow and data flow charts, database entity-relationship diagrams, organizational and classification charts, hierarchy and relationship diagrams, networks, graphs, trees, and more. The basic diagram elements - shapes, links, tables, and containers - can be grouped and attached to each other to form complex structures. The control provides many predefined shapes and the ability to define custom ones. The elements can display rich content, such as formatted text and images. The appearance can be customized through a flexible styling system, node effects, and many built-in themes. The control provides a comprehensive collection of automatic layout algorithms, including Spring-Embedder, Grid, Annealing, Circular, Orthogonal, Topological, Cascade, Triangular, Layered, FlowChart, Workflow, Hierarchical, and multiple Tree layouts.
Tree-structured session storage, compaction and context for PiSharp. Compatibility is limited to recorded acceptance evidence.
Nem__HierarchyTree is a C# library for representing and manipulating hierarchical tree structures using bitwise operations for efficient node management. It is designed for scenarios where unique node identification, fast containment checks, and compact representation are required.
Very simple tree library, holding a class TreeNode<T>. Usage: var peopleTree = new TreeNode<string>("Boss", new TreeNode<string>("Steve", new TreeNode<string>("Maria") ), new TreeNode<string>("Peter") ); Console.WriteLine(peopleTree);
A clean, composable and extensible business rule engine for .NET: sync and async rules, structural composition and rule groups, explain trees, an evaluation ledger, subject-typed and specification rules, feature-gated rollout and scoped parameters, with zero dependencies.
RuleWright JSON-to-domain mapping, structural schema validation with JSON pointer errors, and canonical rule hashing. JSON parsing is abstracted behind IRuleJsonReader; no JSON library dependency.
The library that helps you implement the hierarchical tree structure.
Translate Umbraco content across cultures with AI. umContentTranslator walks your content tree, collects translatable values, batches them, and writes the AI translations back into the target languages — preserving Block Grid and Block List structure, rich text, Markdown, links, and other editor-specific data. Powered by Claude (Anthropic) or OpenAI, it also translates Umbraco dictionary items and adds a Content Translator section with a translation dialog and a Translation Logs dashboard. Includes a built-in free trial.
Akualytics Hierarchy Library - Hierarchical data structures and tree operations for OLAP analytics. Created by Chris Aussem (LinkedIn: https://linkedin.com/in/chris-aussem/)
Hierarchical Markdown AST parser, SIMD structural patch chunker, memory-mapped .gdoc binary persistence, and columnar/graph context decoupling for .NET 10.
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.
Idiomatic .NET library for Visual FoxPro and dBase database files: read AND write .dbf tables, .fpt/.dbt memos, .cdx/.idx indexes, and .dbc database containers (long field names, code pages, NULL/_NullFlags, Varchar). Includes append/update/PACK/ZAP, VFP-compatible record locking, create-DBF/ALTER, create-DBC, CDX (re)indexing with INCREMENTAL index maintenance (every structural .cdx tag is kept up to date on append/update — an O(log n) B-tree edit, so a REPLACE followed by a SEEK finds the row without a REINDEX) plus page-level single-tag DDL (append or drop one tag without rebuilding its siblings), a VFP expression engine with MACHINE/GENERAL collation, a Rushmore-style query optimizer with a SYS(3054)-style ShowPlan (SET EXACT/DELETED/OPTIMIZE semantics, late materialization, an adaptive sparse/dense bitmap, an optional memory-mapped read backend), a VFP-SQL parser + work-area session + executor (SELECT/INNER/LEFT/RIGHT/FULL JOIN/UNION/correlated subqueries, INTO CURSOR/TABLE/ARRAY, DML incl. INSERT FROM ARRAY/MEMVAR, DDL), and the opt-in Highlike cost-based query accelerator (statistics, histograms, cross-query index cache) — all in one package. Output is byte-compatible with the real Visual FoxPro 9 runtime. Primary target Visual FoxPro.
A tool to write the directory tree to the console standard output stream, with colors support and a lot of customization options.
An abp module that provides standard tree structure entity implement.
AnglrParserLibrary provides Anglr Compiler Library for parsing Anglr source files and generating structured outputs such as parse trees, syntax trees, and intermediate representations.
Lightweight composable and structurally adaptable expression trees for reusable Boolean and result-valued expressions and LINQ/EF Core query logic.
A flexible tree hierarchy library with middleware-style action pipelines and event notifications. Register actions at any level to intercept operations (add, remove, update, move) before they execute, enabling validation, transformation, or synchronization with external systems. Events fire before or after operations complete for logging, notifications, or cascading updates.
A minimal, embeddable Visual FoxPro 9 stored-procedure interpreter: a tree-walking interpreter for real VFP9 .prg source (PROCEDURE/FUNCTION definitions, control flow incl. SCAN and FOR EACH, VFP dynamic scoping (LOCAL/PRIVATE/PUBLIC), by-value/by-reference parameter passing, ON ERROR/AERROR error handling, generalised ¯o execution, #DEFINE/#IF preprocessing) running against a live CrossVault.FoxDbf VfpSession - so .prg code that opens tables, seeks, scans, and writes records operates on the same byte-compatible, Rushmore-optimized engine as the rest of CrossVault.FoxDbf. Runs the data side of real business logic: LOCATE/CONTINUE navigation (full FOR/WHILE + scope, in the work area's index order, with per-area CONTINUE state), an INDEX ON TAG/TO write model (structural and non-structural .cdx, standalone .idx, SET ORDER/INDEX, REINDEX, DELETE TAG, tag introspection), REAL row/table buffering (CURSORSETPROP/CURSORGETPROP Buffering 1-5, TABLEUPDATE/TABLEREVERT, OLDVAL/CURVAL/GETFLDSTATE), SET RELATION/SET SKIP parent-child navigation, auto-firing DBC RULEs and referential-integrity triggers (== VFP9), a REAL multi-datasession model (CreateDataSession/ReleaseDataSession, SET DATASESSION TO n — isolated work areas, SETs, buffering and byte-range locks; ASESSIONS/AUSED), low-level file I/O (the FOPEN/FREAD/FWRITE/FSEEK/FCLOSE family, FILETOSTR/STRTOFILE, ADIR), and a broad runtime function library (string/date/math incl. the ...C string-function variants with single-byte-code-page semantics, arrays, TRANSFORM/VARTYPE/STRCONV/TEXTMERGE, session & index introspection). For running real-world VFP9 business-logic stored procedures on .NET without a Visual FoxPro installation. Note the honest limit: RLOCK/LOCK/FLOCK/UNLOCK/ISRLOCKED/ISFLOCKED take REAL VFP-byte-compatible byte-range locks (honouring SET REPROCESS/MULTILOCKS) so a stored proc coordinating via RLOCK is mutually exclusive with a concurrent VFP client, only the SET REPROCESS TO ... SECONDS wait timing is approximated.
A .NET library providing a collection of high-performance, memory-efficient data structures, primarily focused on various trie implementations and advanced search capabilities. Key Features: - Mutable and Immutable Trie Dictionaries: Includes a mutable Double-Array trie and read-only, highly compressed DAWG and LOUDS tries. - Advanced Search: Supports exact match, prefix, common prefix, longest prefix, and wildcard searches (LTR/RTL). - Flexible Record Storage: Each key maps to a list of records, with support for both persistent (serializable) and transient (in-memory) storage per key. - A rich set of underlying data stores, including HashMap, AVL Tree, AA Tree, Treap, and more. Ideal for applications requiring efficient text processing, auto-completion, full-text search engines, morphological analysis, or management of large, static dictionaries. For more details, please visit the project repository on GitHub.
A library for generating directory structure documentation in Markdown format
AnglrMSBuildTasks provides MSBuild tasks for parsing Anglr source files and generating structured outputs such as parse trees, syntax trees, and intermediate representations. These tasks integrate directly into the build pipeline, enabling automatic parsing, tree construction, code generation, and artifact emission. Supports per-file metadata, incremental builds, and seamless integration with the Anglr toolchain.
Drive and inspect RazorConsole apps from the command line: run them in a pseudoterminal session, send input, wait for and assert on the screen, and read the component tree, focus, route, errors and logs of a Development or Debug app. Structured JSON results for CI and AI agents.
A set of tree implementations to make working with hieararchical data structures easier.
XAF module for organization management including departments, staff, and job titles with hierarchical tree structure support.
Generic tree data structure with traversal, serialization, subtree mutation, lowest common ancestor, and flat-to-tree conversion.
SimpleDataCollections is your go-to solution for advanced data structures in .NET. It provides a variety of tree implementations that are optimized for flexibility, performance, and extensibility. Whether you need hierarchical data or lazy-loaded trees, we've got you covered! 🚀
Structured text output: a semantic XHTML writer over the shared content tree, and a GitHub-Flavored Markdown writer over that XHTML. Depends on X-Ray.Office.Core alone. Part of X-Ray.Office, a pure C# port of LibreOffice's document import and rendering; install the X-Ray.Office package for the whole set.
A library to process a sequence of headings (e.g., h1, h2, h3) with explicit nesting levels into a hierarchical tree structure.
3D and 2D spatial indices (uniform grid, k-d tree, octree, BVH, AABB grid) with nearest / k-NN / radius / segment / ray / box / all-pairs queries on points, segments, spheres, triangles, polylines, and user-defined items. Includes a pure-geometry layer in both float and double precision (Vector3d, Plane3D, Triangle3D, Sphere3D, Polyline3D/2D, OrientedBounds3D, BezierCurve2D), rigid transforms (Quaternion + Transform3D), best-fit primitives (line, plane, sphere, circle, principal axes), snap/weld/quantize utilities, 2D path classification (triangle / rectangle / revision-cloud / polygon / polyline), 2D Delaunay triangulation, Bentley-Ottmann segment intersection, mesh inside/outside testing, and SpatialBenchmark — an empirical "which structure is fastest for my data" harness. Multi-targets netstandard2.0 + net8.0.
Trees, List etc. A package that includes data structures and helper methods for console to speed up the data processing process.
XML to JSON is an XML to JSON converter API that turns raw XML strings into structured JSON objects. Send any valid XML payload to receive an organized JSON tree preserving tags, attributes, and child elements.
A tree-structured in-memory cache built on IMemoryCache, with cascade delete, pattern query and batch operations.
This library contains an extensible framework for persistent and augmentable binary trees. Out of the box, it provides AVL and weight-balanced trees, adapters to standard collection interfaces (IReadOnlyList, ISet, IReadOnlySet, IDictionary), and indexed access to elements in sort order. By using a novel(?) persistence strategy, it achieves much better performance than standard immutable collections, and only slightly worse than standard SortedSet. The library also provides a tree iterator, which allows non-recursive tree traversal, as well as traversing only a part of the tree. Introductory and API documentation is available at https://zvrba.github.io/Podaga/html/e165bf08-271a-48ee-a361-c437960f8c68.htm
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.
Core Specification Pattern implementation for .NET 10+. AOT-first, allocation-conscious, DDD-compatible. Includes expression engine, composition, simplification, and structural hashing.
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.
AT Protocol repository data structures: Merkle Search Tree (MST), signed commits, and CAR import/export.
Extracts complete JSON objects or arrays from the beginning of text, stopping once a valid fragment is found, and parses them into navigable tree structures.
Advanced and complementary data structures for modern .NET. Includes DoublyLinkedList, SortedList, PriorityQueue, Deque, PriorityStack, BinarySearchTree, and Graph implementations.
Zero-dependency C# markdown parser — produces structured JSON tree with optional LLM enrichment
IEC 61131-3 Structured Text grammar for tree-sitter (standard, dialect-extensible)
UmbracoHeadlessAPI is a powerful extension for Umbraco that bridges the limitations of the standard Umbraco Content Delivery API, offering an advanced and flexible solution for headless content delivery. While the default Umbraco Content Delivery API does not natively support fetching multinode tree children, this package seamlessly addresses these limitations, enabling retrieval of hierarchical and complex nested content structures.
Overview: The CloudNexInnovations.EnumerableExtensions library offers a suite of powerful and versatile extension methods for IEnumerable<T>, enhancing the capability of collections management and data manipulation in .NET. This package provides developers with easy-to-use, efficient methods that extend the base functionality of IEnumerable, allowing for advanced operations such as converting collections to DataTables, filtering, batching, pagination, and complex data joins, among others. Key Features: ToDataTable: Convert any IEnumerable<T> to a DataTable, making it easy to use with data-binding and reporting tools that require tabular data. DistinctBy: Retrieve distinct elements from a collection based on a specified key selector, offering more flexibility than the standard Distinct method. Batch: Split the collection into smaller, more manageable chunks or batches, which is useful for processing large datasets or implementing pagination in processing routines. Paginate: Simplify data pagination directly on collections, which is essential for creating data-driven user interfaces with paging capabilities. MaxBy and MinBy: Determine the maximum or minimum item in a collection based on a specified key selector, enabling more complex comparison logic than what's possible with standard Max or Min methods. Merge and MergeSorted: Combine two sequences in a controlled manner, either by merging them based on matching keys or by merging two already sorted sequences efficiently. FullOuterJoin: Perform a full outer join on two sequences based on specified key selectors, crucial for relational data manipulations not inherently supported by LINQ. Shuffle: Randomize the order of elements in a collection, which is particularly useful in gaming, simulations, or any scenario requiring random distribution of items. Flatten: Convert a hierarchical or nested structure into a flat sequence, useful for processing tree-like data structures such as file systems or organizational hierarchies. DeepCopy: Create a deep copy of a collection where elements implement ICloneable, ensuring that modifications to the copy do not affect the original collection. SmartDistinct and ConditionalDistinct: Provide advanced filtering capabilities that go beyond simple uniqueness, allowing for element selection based on consecutive comparison or conditional logic. RunningTotal: Compute a running total from a sequence of numbers, useful for financial calculations and cumulative statistics. Usage Scenarios: Data transformation and preparation for reporting and data analysis. Enhancing server-side processing of data for web applications, particularly in ASP.NET. Streamlining complex data manipulations that are common in business applications, such as CRM and ERP systems. Utility functions for games and simulations. Compatibility: Designed to integrate seamlessly with any .NET Standard compliant project, supporting a wide range of .NET implementations including .NET Core, .NET Framework, and others.
A tree-structured, event-driven framework for building AI-agent simulations. Data lives in fields, behavior lives in traits, and communication flows only along parent-child edges.
MCP server and provider installer for fetching GitHub repository directory structures via the git/trees API.