Graph 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

Algorithm and data-structure library for .NET 4.5.2+ / Netstandard 2.0+. Algorithmia contains sophisticated algorithms and data-structures like graphs, priority queues, command, undo-redo and more. Algorithmia is one of the pillars of LLBLGen Pro and is used in production successfully since May 2010. Many of the classes and algorithms in Algorithmia contain references to papers and articles on Wikipedia or other websites where you can find additional information regarding the algorithm or data-structure implemented. The core design of Algorithmia is about making algorithms and data-structures which are known for many years available to the .NET developer in easy to use and properly documented classes and methods. No class or method implemented in Algorithmia re-implements a .NET BCL (base class library) class or method unless it was necessary to do so (e.g. the linked list in .NET is re-implemented as it doesn't have an O(1) concat operation, which is necessary for the Fibonacci heap).

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

Transform any object-graph into a dynamic, composed dictionaries like structure, holding serializable values and type information. Commonly Used Types: Aqua.Dynamic.DynamicObject Aqua.Dynamic.DynamicObjectMapper Aqua.TypeSystem.ConstructorInfo Aqua.TypeSystem.FieldInfo Aqua.TypeSystem.MethodInfo Aqua.TypeSystem.TypeInfo Aqua.TypeSystem.PropertyInfo

QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net

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

Object Extensions can be used to: (1) Create flattend structures (2) Compare or Combine two objects (3) Get or Set member values (4) Deep Clone (5) Save (text file,S3) object graph (6) Get metadata (7) Get type information (8) Create instance (9) Copy to another object (10) Snapshots Visit the project site to get more info on usage: https://harip.github.io/site/printclassinstance

Used for creating key-value representation of object graphs

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

Base library of imbSCI - Coding for Science - library, part of imbVeles framework. The library provides the core layer of shared: enumerations, interfaces and extensions as well as a number of thread-safe collections and data structures. Here are thread-safe multidimensional collections and dictionaries consumed on many layers of the imbSCI and imbACE frameworks.

Generic framework for structuring code for CQRS+ES using Graph QL and RabbitMQ

.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+ Supports Source Link

Extended and typed DataTables, DataTable to Excel reporting, various graph structures, translation tables, trend estimation structures, path DOM, reporting extensions, TF-IDF corpus and document data structures, data structures for reporting and other stuff in context of imbSCI framework

.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+ Supports Source Link

Graphviz is open source graph visualization software. Graph visualization is a way of representing structural information as diagrams of abstract graphs and networks. It has important applications in networking, bioinformatics, software engineering, database and web design, machine learning, and in visual interfaces for other technical domains.

Organize and displays Workflows in a Tree structure and Graphs

A fast object graph binary serialization for .NET with support for: * serialization of classes, structures and primitives at root or type member level; * serialization of derived types referenced by interface, base class or abstract class type; * serialization of POCO objects; * standard NonSerializedAttribute and dedicated NonSerializedBackendAttribute for automatic properties; * serialization of classes without parameter-less constructor; * serialization of arrays and collections implementing ICollection<T>

imbSCI libraries will help you with in-code data annotation for easier reporting, some interesting data structures (like directed and free graphs, multidimensional collections…), serialization and data manipulation, script driven reporting, single-model for multiple-outputs, static web site generation, generation of D3 (JavaScript) charts and graphs, text templates. Data formats covered: text, markdown, html, html-bootstrap, open document text, Excel spreadsheet, CSV, XML, JSON, R Tidy Dataset and more.

imbSCI.Graph is an extension package for imbSCI library, extending graph classes with undirected graph object model and implementation for DGML, Dia, MXGraph (Draw.io) and DOT graph formats. Supports SVG rendering of charts (histograms, pie, bar and linear charts - in 2D and 3D.) and graph structures.

DAWG (Directed Acyclic Word Graph) is a data structure for storing and searching large word lists while keeping your memory footprint small and lookups fast. DawgSharp is an open-source C# implementation featuring a linear time graph reduction algorithm and out-of-the-box persistence support. The Dawg class is nearly as fast as a HashSet for lookups and is much, much more memory-efficient (factors of 30x - 40x are not uncommon). In a benchmark application it held two million words while consuming only 2Mbytes of RAM. That's only one byte per word! And it's even less on disk. The Dawg class can be thought of as a read-only Dictionary<string, Value>: it has a ["string"] indexer and implements IEnumerable<KeyValuePair<string, Value>>. One other very useful feature of Dawg (not found in Dictionary) is the ability to quickly find all words that start with a particular prefix: dawg.MatchPrefix("star") could possibly yield "star", "starch", "start", "starting", etc. This package is provided under the terms of the GNU GPL v3. Source code and documentation are available on GitHub: https://github.com/bzaar/DawgSharp. Commercial licenses are also available at http://morpher.co.uk

.NET library that provide mainly graphs structures and algorithms for C#. 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

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

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);

imbSCI.Graph is an extension package for imbSCI, extending graph classes with undirected graph object model and implementation for DGML, Dia, MXGraph (Draw.io) and DOT graph formats. Supports SVG rendering of charts (histograms, pie, bar and linear charts - in 2D and 3D.) and graph structures.

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 central modelling components for agent-based simulation. It contains agent environments with update spatial indexing structures for agents and graphs as well as GIS layer to process vector files (*.geojson, *.shp, *.kml, *.gml) and raster files (*.geotiff, *tiff, *.asc). For more details how to use MARS, please use the documentation: https://www.mars-group.org/docs/tutorial/intro

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

Methods and classes I usually need when dealing with RDF-data. ISparqlQueryHandler to run queries against IGraph and SparqlRemoteEndpoints, Extensions to create OR get Nodes from Graphs, some standard (read) queries, structures to store nodes

Contains or extends useful data structures and graph traversal algorithms that are not part of .NET

Utilities for operating graph structures

.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+ Supports Source Link

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

Provides serialization features related to FastGraph data structures. This package is the serialization subset of the original QuickGraph (later forked as YC.QuickGraph and QuikGraph), specifically forked to support .NET 6 and C# 10. It should be seen as an alpha-quality cutting-edge alternative to QuikGraph.Data.

Provides convenient graph helpers related to DataTable (and also serialization to Graphviz). This package is a subset related to DataTable of the original QuickGraph (later forked as YC.QuickGraph and QuikGraph), specifically forked to support .NET 6 and C# 10. It should be seen as an alpha-quality cutting-edge alternative to QuikGraph.Data.

Provides a bridge from FastGraph graphs structures to Graphviz and Dot language serialization. This package is the Graphviz subet of the original QuickGraph (later forked as YC.QuickGraph and QuikGraph), specifically forked to support .NET 6 and C# 10. It should be seen as an alpha-quality cutting-edge alternative to QuikGraph.Graphviz.

Provides graph structures and algorithms. FastGraph provides generic directed/undirected graph data structures and algorithms. 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 (later forked as YC.QuickGraph and QuikGraph), specifically forked to support .NET 6 and C# 10. It should be seen as an alpha-quality cutting-edge alternative to QuikGraph.

Provides a bridge from FastGraph graphs to MSAGL library. This package is the MSAGL subset of the original QuickGraph (later forked as YC.QuickGraph and QuikGraph), specifically forked to support .NET 6 and C# 10. It should be seen as an alpha-quality cutting-edge alternative to QuikGraph.MSAGL.

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 (later forked as YC.QuickGraph and QuikGraph), specifically forked to support .NET 6 and C# 10. It should be seen as an alpha-quality cutting-edge alternative to QuikGraph.Petri.

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.DI is not a framework or library, but a source code generator for creating object graphs. To make them accurate, the developer uses a set of intuitive hints from the Pure.DI API. During the compilation phase, Pure.DI determines the optimal graph structure, checks its correctness, and generates partial class code to create object graphs in the Pure DI paradigm using only basic language constructs. The resulting generated code is robust, works everywhere, throws no exceptions, does not depend on .NET library calls or .NET reflections, is efficient in terms of performance and memory consumption, and is subject to all optimizations. This code can be easily integrated into an application because it does not use unnecessary delegates, additional calls to any methods, type conversions, boxing/unboxing, etc.

MindFusion.Diagramming for WPF 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 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 ASP.NET MVC 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.

Static web site creation, templating, scriptable reporting and other support classes for reporting. imbSCI libraries will help you with in-code data annotation for easier reporting, some interesting data structures (like directed and free graphs, multidimensional collections…), serialization and data manipulation, script driven reporting, single-model for multiple-outputs, static web site generation, generation of D3 (JavaScript) charts and graphs, text templates. Data formats covered: text, markdown, html, html-bootstrap, open document text, Excel spreadsheet, CSV, XML, JSON, R Tidy Dataset and more.

Allows you to create a simple workflow structure from specially marked up handler methods, in which the input and output types are the links between the work items.

ADO.NET Micro-ORM to SQL Server, implemented as .NET Standard 2.1 (since version 3.5.x) or a .Net Core 6.0 library (since version 3.0.0). Use version 2.x.x, which was built with Net Standard 2.0, if you want to utilise this library with the .Net Framework or a previous version of .NET Core. This library is designed to use stored procedures, table-valued parameters and structured static mappers, with the goal of reading and saving of complex object graphs at once in the fast, convinient and efficient way. Read more: https://www.codeproject.com/articles/1155836/artisan-orm-or-how-to-reinvent-the-wheel

Friendly wrapper/handler for the Microsoft Azure Active Directory Graph SDK Client. Provides a more a structured approach to using the SDK with more helpful annotations. Also includes a facility for injecting a CacheProvider. See GitHub Project link for more details: https://github.com/nrogoff/AADGraphHandler

General purpose data structures and algorithms mostly to cover the functionallity or performance gap in the framework. Includes: ProrityQueue, Bag, SymboleTable, Trie, UnionFind, Search Trees (BST, OST, RBT), sorting and graph algorithms.