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.
####Buld
Use VS 2013 for build. Note thet F# 3.1 required.
| .NET |
|---|
 |
####Where to go next? Documentation