.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,...
More information
Sandwych.QuickGraph is a port of the awesome QuickGraph to .NET Standard, it provides generic directed/undirected graph datastructures and algorithms for .NET.
.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...
More information
Graph# is a graph layout framework. It contains some layout algorithms and a GraphLayout control for WPF applications. This is a unofficial release of the library.
GraphX for .NET is an advanced graph visualization library that uses different layout and edge routing algorithms, implements many features and supports custom visual templates.
This release features WPF/Core/UWP visualization only. Logic & algorithm libraries are available for many platforms.
QuickGraph provides generic directed/undirected graph datastructures and algorithms for .NET. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, etc...
.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...
More information
QuickGraph .NET standard.
QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net. 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...
More information
This is a small library that implements a meldable priority queue and a generalizable A* search algorithm on top of that. The performance is good. It targets PCL profile 111.
This is a small library that implements a meldable priority queue and a generalizable A* search algorithm on top of that. The performance is good. It targets PCL profile 111.
.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...
More information
Graph# is a graph layout framework. It contains some layout algorithms and a GraphLayout control for WPF applications. This is a unofficial release of the library.
Graph# (SIL) is a graph layout framework. It contains some layout algorithms and a GraphLayout control for WPF applications. This is a fork of the Graph# library.
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...
More information
