| Build | |
| Coverage | Coveralls  SonarQube |
| Quality | |
| Nuget |  |
| License | MS-PL |
QuikGraph provides generic directed/undirected graph data structures and algorithms for .NET.
QuikGraph comes with algorithms such as depth first search, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, etc.
QuikGraph was originally created by Jonathan "Peli" de Halleux in 2003 and named QuickGraph.
It was then updated to become YC.QuickGraph.
This version of QuickGraph, renamed QuikGraph, is a fork of YC.QuickGraph, and I tried to clean the Core of the library to provide it as a clean NuGet package using modern C# development (.NET Core).
The plan would be to fully clean the original library and all its non Core parts and unit test it more.
- Clone this repository.
- Open QuikGraph.sln.
The library get rid of PEX that was previously used for unit tests and now uses NUnit3 (not published).
I would be very pleased to receive pull requests to further test or improve the library.
- Documentation
- External Information (The website was closed)