Skip to content

Latest commit

 

History

History
94 lines (60 loc) · 4.32 KB

README.md

File metadata and controls

94 lines (60 loc) · 4.32 KB
Build AppVeyor Build Status
Coverage Coveralls Coverage Status SonarQube SonarCloud Coverage
Quality Quality Gate
Nugets Nuget Status QuikGraph
Nuget Status QuikGraph.Serialization
Nuget Status QuikGraph.Graphviz
Nuget Status QuikGraph.Data
Nuget Status QuikGraph.MSAGL
Nuget Status QuikGraph.Petri
License MS-PL

QuikGraph

What is QuikGraph?

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 library to provide it as a clean NuGet packages using modern C# development (.NET Core).

The plan is to to fully clean, fix issues of the original library and all its non Core parts, and improve it.


Targets

  • .NET Standard
  • .NET Core
  • .NET Framework

Supports Source Link (use dedicated symbol package)

To get it working you need to:


Contributing

Build

  • Clone this repository.
  • Open QuikGraph.sln.

Notes

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, improve or add new features to the library.


Usage

Packages

QuikGraph is available on NuGet in several modules.

Where to go next?


Maintainer(s)

Contributor(s)

This project exists thanks to all the people who have contributed to the code base.