Tree Structure

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...

A generic graph object for your own needs to implement syntax trees and similar constructs. Provides you with a name/value/children type of graph object, where your value can be any object type you wish. The project encapsulates the C# implementation of Hyperlambda, implying its lambda node structure. To use package go to https://polterguy.github.io

Correct QuickGraph version for projects such as GraphX that use cross-platform PCL libraries. 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...

A simple and elegant solution to displaying hierarchical tree structures (i.e. a Tree View) while levering the best that Twitter Bootstrap has to offer.

A generic implementation of a centered interval tree in C#. In computer science, an interval tree is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is often used for windowing queries, for instance, to find all roads on a computerized map inside a rectangular viewport, or to find all visible elements inside a three-dimensional scene.

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.

imbSCI.Core library of imbSCI module (imbVeles framework). Provides attributes for data annotation, data aggregation, reporting, PropertyExpression, type description data (advanced reflection), rich extensions library (data, enum works, input/output, math, DataTable, text manipulation, type works (enhanced reflection)), file-data structures, directory tree data model, string templates, color manipulation, HTML/Markdown creation ...

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...

JSON will be transformed into a tree structure of the key of Dictionary, and use the Find(key1).Find(key2) method to get object.

Ready to Xamarin & .NET Core, File System & Zip Archive Access Library. include Tree-Structure Defenition.

QuickGraph provides generic directed/undirected graph data structures and algorithms for .Net, Silverlight, Windows Phone and Win 8. QuickGraph comes with algorithms such as depth first search, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc...

Bootstrap Treeview by Gijgo.com is a plug-in for the jQuery Javascript library. It is a very fast and extandable tool, and will add advanced interaction controls to any tree structure. This plugin allows you to create tree structure using bootstrap or material design styles. Free open source tool distributed under MIT License.

CodeJam is a set of handy reusable .NET components that can simplify your daily work and save your time when you copy and paste your favorite helper methods and classes from one project to another.

Abp.GeneralTree Based on the idea of Organizations in Abp, we did a general management of the entity tree structure.

Grapes it is an utility library which takes care of mapping tree-like data structures into database. Probably you want to install Brandy.Grapes.NHibernate or Brandy.Grapes.FluentNHibernate

Class library for tree data structures, as well as tables and lists.

CompoundFileStorage is a 100% C# .NET component that allows developers to manipulate Microsoft Compound Document File Format for OLE structured storage. It supports read/write operations on streams and storages and traversal of structures trees. Initialy this package is the same as the OpenMcdf package the only difference is that the original code is upgraded to more now a days standards and C# .NET 4.0

--ONLY FOR TEST-- Abp.GeneralTree Based on the idea of Organizations in Abp, we did a general management of the entity tree structure.

Loyc.Collections is a library of sophisticated data structures that implement standard .NET collection interfaces. It includes ALists, VLists, hash tree types (Set<T>, MSet<T>, Map<K,V> and MMap<K,V>), and min/max heaps.

Organize and displays Workflows in a Tree structure and Graphs

wham EntryTree provides tree structure of entry/entrygroup choices in given entry. Helpful for immediate resolution which group was parent for some child selection.

Trie (a.k.a. prefix tree) is an ordered tree data structure that is used to store an associative array where the keys are usually strings. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string.

Top-quality toolkit of algorithms and data structures for .NET developers.

Functional filter abstraction for creating, applying, mapping, and reducing combinatory filter structures

OpenMcdf is a 100% .NET / C# component that allows developers to manipulate Microsoft Compound Document File Format for OLE structured storage. It supports read/write operations on streams and storages and traversal of directory trees.

A library containing useful data structures like Trees, Tries, Sparse Arrays, Bloom Filters and indexing tailored dictionaries.

A library for all the data structures in C#. Every class is generic and reusable.

DBreeze database key features: - Embedded .NET family assembly, platform independent and without references to other libraries. - Multi-threaded, ACID compliant, with a solution for deadlocks resolving/elimination, parallel reads and synchronized writes/reads. - No fixed scheme for table names (construction and access on the fly). - Tables can reside in mixed locations: different folders, hard drives, memory, in-memory with disk persistence. - Liana-Trie indexing technology. Database indexes (keys) never need to be defragmented. Speed of insert/update/remove operations doesn't change during the time. - Ability to access Key/Value pair of a table by physical link, that can economize time for joining necessary data structures. - No limits for database size (except "long" size for each table and physical resources constraints). - Low memory and physical space consumption, also while random inserts and updates. Updates reside the same physical space, when possible or configured. - High performance of CRUD operations. When you need, unleash DBreeze power and get 500000 key/value pairs insert or 260K updates per second per core into sorted table on the hard drive of standard PC (benchmark in year 2012). - High speed of random keys batch inserts and updates (update mode is selectable). - Range selects / Traversing (Forward, Backward, From/To, Skip, StartsWith etc). Remove keys, change keys. - Keys and values, on the low level, are always byte arrays. - Max. key size is 65KB, max. value size is 2GB. Value can be represented as a set of columns, where can be stored data types of fixed or dynamic length. Every dynamic datablock (BLOB) can be of size 2GB. - Rich set of conversion functions from/to between byte[] and other data types. - Nested / Fractal tables which can reside inside of master tables values. - Incremental backup/restore option. - Integrated text-search subsystem (full-text/partial). - Integrated object database layer. - Fast multi-parameter search subsystem with powerful query possibilities. - Integrated Vector Database and vector similarity search engine (embedding vectors store/search). - Integrated binary and JSON serializer Biser.NET - High Availability, Redundancy and Fault Tolerance via Raft.NET - DBreeze is a foundation for complex data storage solutions (graph/neuro, object, document, text search etc. data layers). Please, study documentation to understand all abilities of DBreeze. hhblaze@gmail.com

An abp module that provides standard tree structure entity implement.

Explore trees and tree-like structures with LINQ using tree-traversal algorithms like breadth-first and depth-first search: IEnumerable<DirectoryInfo> childDirectories = Traverse.DepthFirst(new DirectoryInfo(...), d => d.EnumerateDirectories()); IEnumerable<DirectoryInfo> parentDirectories = Traverse.Along(new DirectoryInfo(...), d => d.Parent);

OpenMcdf is a 100% .net / C# component that allows developers to manipulate Microsoft Compound Document File Format for OLE structured storage. It supports read/write operations on streams and storages and traversal of structures tree.

CMS Query Language (CMSQL), is a DSL specifically designed for use in Content Management Systems to query over tree structured data.

Spatial Index data structure; used to make it easier to find data points on a two dimensional plane.

This .NET/Mono library provides some utilities for handling tree structures. Most importantly, it supports the display of tree structures as two-dimensional graphics. By using ready-made interfaces, you can specify the size of your nodes, and the Tree Layout Helper library will take care of placing those nodes appropriately.

This package provides multiple collection such as improvided (KdTree with selection, Fibonacci heaps, ...) implementation and commonly used extension for .Net types.based methods and algorithms to handle math computing taks. For more details how to use MARS, please use the documentation: https://www.mars-group.org/docs/tutorial/intro

A ternary search tree backed implementation of the generic IDictionary interface. This data structure supports also interesting search methods such as partial match and near-neighbor match. For instance, the near neighbor search can be used to provide similar words in the dictionary.

An abp module that provides standard tree structure entity implement.

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...

ASP .NET MVC Helper for a building a tree structure.

A library for customizable parsing of markdown documents and transforming into other formats. This package contains the structure of the abstract syntax tree.

k-Nearest Neighbors Search Algorithm, based on the RBush data structure

An abp module that provides standard tree structure entity implement.

MindFusion.Diagramming for WebForms adds to web 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 WebForms supports several front-ends - HTML Canvas, Java Applet, and Image Map. For additional information regarding any of these modes, check http://www.mindfusion.eu/onlinehelp/netdiagram/index.htm?NetDiagram_front_ends.htm.

Read data from strings in XML/JSON/YAML/CSV formats into a tree structure. Create data nodes manually and serialize it back to those formats.

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

Features * Supports both local data and remote data (JSON) * Smooth expand/collapse effects * Align the chart in 8 orientations * Allows user to change orgchart * structure by drag/drop nodes * Supports pan and zoom * Edit Form * Node Customization * Search * Scroll Bars * Lazy Loading * Mixed Hierarchy * Exporting

A trie (prefix tree) data structure implementation in C#.

An abp module that provides standard tree structure entity implement.

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.

An abp module that provides standard tree structure entity implement.