This package provides an in-memory B-Tree implementation for C#, useful as an ordered, mutable data structure.
Structure-only clean room for Fuaran.UI.Ops — a content-free skeleton projection (project : Node<'Msg> -> Skeleton) plus a substitutable structural-op gate that withholds any inbound TreeOp referencing an unknown NodeId, authoring content, or off the move/reorder/reparent/delete allowlist. Lets an untrusted party reorganise a tree's structure by id without receiving its content. Additive + Fable-clean. Apache-2.0.
Fuaran.Core.Idl.Codegen — the generation half of the IDL engine: the F# structural-layer emitter with its declared-support channel (docs, splices, host projections), the TypeScript encoder backend, the JSON-schema emitter, the scaffold writer, the codegen trust boundary (allowlisted `Custom` resolution, sanitisation applied before emission), and the stability diff classifier over two `idl.json` revisions. Build-time only and .NET-only — it emits source, so its contract is the shape of what it emits; the model, codec and sampler it reads ship separately as Fuaran.Core.Idl. FSharp.Core + Fuaran.Core.Idl + Fuaran.Core.Wire only.
gRPC transport binding and strongly typed client for Orleans.Lattice.Api.State. Exposes the read-only cluster state API (tree, view and tag-index discovery, tag-member scans, tree structure, entry scans, point reads, per-key history, scan cancellation, metrics snapshots, cluster information, dead letters, and the auth-scheme advertisement) as seventeen unary RPCs plus server-streaming change and metrics subscriptions, over a code-first, Orleans-serialized contract, with a pluggable authorization seam and a default-deny posture. Registered with AddLatticeStateApiGrpc(...) and mapped with MapLatticeStateApiGrpc().
MindFusion.Diagramming for WinUI 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.
C# implementation of a Trie (prefix tree) that is IEnumerable. You may conduct a prefix tree and not have to run on the trie all the way to it's end - just for the amount of results you need. This is perfect for autocomplete or any other scenario where you may want a fixed amount of results yielded in every search.
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.
Foresty implements generic functionality for tree- or forest-like structures, like depth-first and breadth-first traverses. It provides two approaches: enumerators for Linq-like, ordered node enumerations and visitors to invoke functions for each node in order. Supports .Net Framework 4.0, 4.5+ and dotnet core 1 and 2.
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.
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.
Traverses the ASTs of two LINQ expression trees and compares them node-by-node, value-by-value. Also provides structural hash code computation.
Optional read-only cluster state API add-on for Orleans.Lattice. Exposes a transport-agnostic facade (and, via a sibling binding, a gRPC surface) that lets external clients query, observe, and subscribe to a cluster's tree state and metadata - trees, shards, structure, entries and their history, views, tag indexes, and schema dead letters, plus live change and per-tree metrics subscriptions - for a tree-explorer dashboard and the Orleans.Lattice.Api.Mcp MCP server. Registered with a single AddLatticeStateApi(...) call.
A tree like structured list which enables the user to navigate through different levels of menu items
Syncfusion® ASP.NET Core TreeGrid control is a feature-rich hierarchical data grid for displaying tree-structured (parent-child) tabular data. It supports self-referential and hierarchical data binding, lazy loading, virtual scrolling, column resizing, reordering, sorting, filtering, editing (inline, dialog, batch), aggregates, summary rows, column templates, row drag-and-drop, export to Excel/PDF, and accessibility. It is ideal for displaying organizational charts, file systems, bill of materials, and nested data structures in ASP.NET Core applications.
Algorithms and data structures teached at University of Applied Sciences Salzburg, MMT degree program
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.
VirtualStorageLibrary is a fully in-memory .NET library that provides a tree-structured collection. It offers a foundation for managing hierarchical data structures and supports items, directories, and symbolic links with user-defined types. This library is not a file system; instead, it is inspired by traditional file system concepts but redesigned to be more flexible and user-friendly. Users can intuitively reference, traverse, and manipulate nodes by specifying paths, making it ideal for applications needing a high-performance virtual storage solution.
Fuaran.Core.Idl.Cli — the IDL stability classifier as a command (`fuaran-core-idl`). Classifies the delta between two `idl.json` revisions: the wire severity per changed member with the reason it applies, the wire-profile evolution, and the F# consequence classes a consumer compiled against the generated structural layer meets. Exits 0 / 3 / 4 for absorbable / breaking / undecided, or asserts a declared class with `--expect`; `spike-proposal` prices a vocabulary-change proposal against a vocabulary. .NET-only and build-time; the classification it prints lives in Fuaran.Core.Idl.Codegen.
Defines an architecture of persistent users, roles and privileges that can be used to provide detailed authorization in applications. Privileges are ordered in a tree structure. Roles contains a list of allowed privileges (nodes or entire branches), or explicitly prohibited privileges (nodes or branches). Each user can be assigned one or more roles. Credentials are protected using hash digests. Objects are persisted through the object database abstraction layer, defined in Waher.Persistence.
Syncfusion® ASP.NET MVC TreeGrid control is a feature-rich hierarchical data grid for displaying tree-structured (parent-child) tabular data. It supports self-referential and hierarchical data binding, lazy loading, virtual scrolling, column resizing, reordering, sorting, filtering, editing (inline, dialog, batch), aggregates, summary rows, column templates, row drag-and-drop, export to Excel/PDF, and accessibility. It is ideal for displaying organizational charts, file systems, bill of materials, and nested data structures in ASP.NET MVC applications.
This C# lightweight library provides extension methods to traverse hierarchy structures. It may work for other graph types as well.
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.
Generic tree structure accessed via disk-like paths. Useful for project hierarchies where resources can be decoupled from the tree.
Contains a generic tree implementation, as well as extension methods for traversing any tree like structure
Basic data structures in C# convenient for many applications. Currently contains only trees and ordered trees.
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
Fuaran.Compute.ColumnOps — a columnar op-algebra over Fuaran.Core.Column's Table (SetCell / SetColumn / InsertColumn / RemoveColumn / AppendRows / ApplyTransform) with a total apply / canApply, a partial invert (undo/redo), a structural Diff, a canonical wire codec, and a Fuaran.Core.OpStream StreamWitness — so table edits become an append-only, hash-chained, replayable, tamper-evident stream (the columnar analogue of the tree op-stream). No base type, no new witness field (the op DU is self-contained over Table; OpStream stays generic over its (apply, encode, decode) witness). FSharp.Core only, Fable-clean.
A little library with useful data structures and extension methods. Very useful for students ^-^
Data structures: tree, normalized dictionary, collections...
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.
Important: call builder.UseMindFusionDiagramming() from BuildAvaloniaApp. MindFusion.Diagramming for Avalonia 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...
This code implements architecture that handles search for game engines. It has four main classes: Entity, EntityFactory, EntityTree, and EntityTreeManager. Entity is the basic structure of an entity that has an identifier and a list of observers notified when the entity is destroyed. EntityFactory creates and destroys entities and adds entities to trees managed by EntityTreeManager. EntityTree is a generic tree structure that stores entities and notifies observers when an entity is destroyed. EntityTreeManager manages a collection of trees, allows adding and removing trees, and enables adding entities to one or more trees and registering the trees as observers of the entities.
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.
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...