graph-generators: Functions for generating structured or random FGL graphs

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.


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]


Change logchangelog
Dependenciesbase (>=4.2 && <4.8), containers (>=0.3), fgl (>=5.0), multiset (>=0.2), mwc‑random (>=0.10) [details]
CopyrightCopyright (C) 2014 Uli Köhler
AuthorUli Köhler
CategoryGraphs, Algorithms
Home page
Source repositoryhead: git clone
UploadedSun Apr 20 16:03:59 UTC 2014 by ulikoehler




Maintainers' corner

For package maintainers and hackage trustees

Readme for graph-generators-

[back to package description]


A Haskell library for creating regular and random graphs in a graph-library agnostic way.