Home
FastGraph provides generic directed/undirected graph data structures and algorithms for .NET.
FastGraph comes with algorithms such as depth first search, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, etc.
- Reflector.Graph Add-in
- Graph#, layout algorithms
- Jolt.Net, a backing store for a generic finite state machine implementation
- JSL StyleCop, Custom rules for Microsoft's StyleCop utility
- NDepend, codebase macro analysis
- Dependency Viewer
FastGraph supports a wide range of targets for maximal compatibility.
- .NET Standard 1.3+
- .NET Core 1.0+
- .NET Framework 3.5+
- Works under Unity 3D
Supports Source Link
Getting started with FastGraph
This example takes a DataSet, builds the graph of tables and constraints from the schema and computes the table topological sort.
This can be useful to figure order to populate a database.
var dataSet = new DataSet(); // Get your data set
DataSetGraph graph = dataSet.ToGraph(); // Wraps the dataset into a DataSetGraph
foreach(DataTable table in graph.TopologicalSort()) // Applies a topological sort to the data set graph
{
Console.WriteLine(table.TableName); // In which order should we delete the tables?
}See also DataSetGraph.
FastGraph is available on NuGet in several modules.
PM> Install-Package FastGraph
PM> Install-Package FastGraph.Serialization
PM> Install-Package FastGraph.Graphviz
PM> Install-Package FastGraph.Data
PM> Install-Package FastGraph.MSAGL
PM> Install-Package FastGraph.Petri