The graph-generators package
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]
|Versions||0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.2.0, 0.1.3.0|
|Dependencies||base (>=4.2 && <4.8), containers (>=0.3), fgl (>=5.0), multiset (>=0.2), mwc-random (>=0.10) [details]|
|Copyright||Copyright (C) 2014 Uli Köhler|
|Source repository||head: git clone https://github.com/ulikoehler/graph-generators|
|Uploaded||Sat Apr 19 22:20:15 UTC 2014 by ulikoehler|
- graph-generators-0.1.2.0.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
For package maintainers and hackage trustees