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, etc.
QuickGraph was originally created by Jonathan "Peli" de Halleux in 2003.
| Branch | .NET |
|---|---|
| Master |  |
| GraphTasks |  |
Clone repo with git clone --recursive to get all external dependencies.
Visual Studio 2013 and F# 3.1 are required for build. For Visual Studio 2015 install Build Tools 2013 standalone package.