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]
Properties
| Versions | 0.1.0.0, 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.3.0, 0.1.4.0 |
|---|---|
| Change log | None available |
| Dependencies | base (>=4.2 && <4.8), containers (>=0.3), fgl (>=5.0), multiset (>=0.2), mwc-random (>=0.10) [details] |
| License | Apache-2.0 |
| Author | Uli Köhler |
| Maintainer | ukoehler@techoverflow.net |
| Category | Graphs, Algorithms |
| Home page | https://github.com/ulikoehler/graph-random |
| Source repo | head: git clone https://github.com/ulikoehler/graph-generators |
| Uploaded | by ulikoehler at 2014-04-19T15:54:09Z |
Modules
[Index]
Downloads
- graph-generators-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees