Tree Structure

Extension to easily visualize a tree structure using Ascii only. As the XML Comments doesn't work with .net standard library (for some reason), i will explain the usage here: You may now use multiple parameters (in brackets): "{parametername1} {parametername2}" etc. (or formatted : Name:{offcie_name} Number:{office_number}) or single parameter: "Name" etc. (with or without brackets). Usage : object.ToAsciiTree("Name","Childs","Tree"); or object.ToAsciiTree("Name:{Name} Some other property:{SomethingElse}","Childs","Tree");

Search any tree-like data structure with wildcard and globbing patterns.

Efficient implementations of standard .NET collection interfaces using tree data structures.

Grapes it is an utility library which takes care of mapping tree-like data structures into database.

A tree structure with inherited properties.

MASBicudo Data Structures - Immutables, Continuous.

An abp module that provides standard tree structure entity implement.

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.

Object-Tree validation tools. Simple and readable validation of the structure and data of any object tree. Validation assertions can be either INamedPredicates or NUnit assertion constraints.

MoreStructures is a library of classical algorithms and data structures, written 100% in (safe, managed) C# 10, for .NET 6 and above. Data structures - Stacks, Queues, Priority Queues, Disjoint Sets, Trees, Graphs, Suffix Trees, Suffix Tries. Algorithms - Strings sorting and matching. Lists searching and sorting. Trees augmentation and visit. Graphs: visits, minimum spanning tree, shortest distance, shortest path, topological sorting, strongly connected components. Suffix Trees and Tries construction and matching.

Very simple tree data structures on .NET Standard

FSharp library which implements different data structures.

Fast, immutable collections based on tree structures

Spatial data structures, like grids or quad trees for .net.

A little library with useful data structures and extension methods. Very useful for students ^-^

A generic Trie implementation with an abstracted storage pattern for simple replacement with more complex storage needs.

Tree structure with algorithms

Grapes it is an utility library which takes care of mapping tree-like data structures into database.

Tree structure with algorithms

A tree structure drawers for console applications.

AVL and Binary Search Tree data structures and traversal algorithms, such as: BFS and 3 variants of DFS

A .NET library containing various data structures and algorithms, such as random-access lists and finger trees.

Promptuarium is a versatile, tree-based data structure to store or exchange data and metadata efficiently (in binary format). Written in pure C#, can be used in F#, too.

Contains a simple generic class intended to be used as a base class for any data structure that needs to implement basic tree functionality: naming, parenting, and maintaining a collection of children. Also includes the associated interface for alternate implementations. Inlcudes source.

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 C# Tree structure library with functions for creating a radial tree layout.

The tree-structure extension in regards to the Xtender library. Provides a compositional data-structure to create trees in combination with the Xtender library.

Important: call builder.UseMindFusionDiagramming() from CreateMauiApp. 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.

MindFusion.Diagramming for Silverlight 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.

Provides a basic implementation of weight-balanced binary trees. - A list by a weight-balanced binary tree, with all O(log n) basic operations - A set and a map by weight-balanced binary search trees, which can be accessed by index in O(log n) time

An octree is a tree structure for storing sparse 3-D data.

Library of data structures (fourth unit) according to the computer science curriculum of the Israel Ministry of Education for a final examination.

Advanced data structures for .NET

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.

A tree like structured list which enables the user to navigate through different levels of menu items

A library to process a sequence of headings (e.g., h1, h2, h3) with explicit nesting levels into a hierarchical tree structure.

This is a C# library designed for effectively handling tree structures. Emphasizing flexibility and extensibility, the library allows easy manipulation of various tree structures. Features: A rich set of extension methods for `ITreeNode<TNode>` Mutual referencing between parent and child nodes A collection of tree-structured classes with high extensibility Conversion between different data structures and tree structures Generic utility classes needed for implementing the above features

Basic data structures in C# convenient for many applications. Currently contains only trees and ordered trees.

Tree structures for .NET Framework

Data structures: tree, normalized dictionary, collections...

Generic tree structure accessed via disk-like paths. Useful for project hierarchies where resources can be decoupled from the tree.

QuickGraph provides generic directed/undirected graph datastructures and algorithms for .NET Standard 2.0 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...

MindFusion.Diagramming for Blazor 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.

QuickGraph provides generic directed/undirected graph datastructures and algorithms for .NET Standard 2.0 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...

Pure .NET Key-Value and Set databases. Inspired by LevelDB and SSTables and Log Structured Merge Trees.

TreeSharp is a C# class library that simplifies working with tree structures in your code. With TreeSharp, you can easily build a list of items as a tree, and retrieve all children, parents, and leaves of a specific item within that tree.

Thread-safe tree data structure library with event propagation.

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.

Fork of GuiLabs.Language.Xml, a full-fidelity XML parser. Produces a syntax tree from XML text, preserves all whitespace and provides low-level API to examine the exact structure of the source text.

C# implementation of a Rope immutable data structure. A Rope is an immutable sequence built using a b-tree style data structure that is useful for efficiently applying and storing edits, most commonly used with strings, but any list or sequence can be efficiently edited using the Rope data structure.