A graph library with goals of speed and simplicity, Graph implements graph algorithms on graphs of zero-based integer node IDs.
The library provides efficient graph representations and many methods on graph types. It can be imported and used directly in many applications that require or can benefit from graph algorithms.
The library should also be considered as library of source code that can serve as starting material for coding variant or more complex algorithms.
The directory tutorials is a work in progress - there are only a few tutorials there yet - but the concept is to provide some topical walk-throughs to supplement godoc. The source-based godoc documentation remains the primary documentation.
The directory anecdote contains a stand-alone program that performs single runs of a number of methods, collecting one-off or "anecdotal" timings. It currently runs only a small fraction of the library methods but may still be of interest for giving a general idea of how fast some methods run.
The directory bench is another work in progress. The concept is to present some plots showing benchmark performance approaching some theoretical asymptote.
hacking.adoc has some information about how the library is developed, built, and tested. It might be of interest if for example you plan to fork or contribute to the the repository.
All files in the repository are licensed with the MIT License, https://opensource.org/licenses/MIT.