The graph-generators package


Generators for graphs. Supports classic (constant-sized) graphs, deterministic Generators and different random graph generators, based on mwc-random. This library uses a library-agnostic and space-efficient graph representation. Combinators are provided to convert said representation to other graph representations (currently only FGL, see Data.Graph.Generators.FGL) Note that this library is in its early development stages. Don't use it for production code without checking the correctness of the algorithm implementation..

[Skip to ReadMe]


Dependenciesbase (>=4.2 && <4.8), containers (>=0.3), fgl (>=5.0), multiset (>=0.2), mwc-random (>=0.10) [details]
AuthorUli Köhler
CategoryGraphs, Algorithms
Home page
Source repositoryhead: git clone
UploadedSat Apr 19 15:54:09 UTC 2014 by ulikoehler




Maintainers' corner

For package maintainers and hackage trustees

Readme for graph-generators-


A Haskell library for creating random Data.Graph instances using several pop