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

[ algorithms, apache, graphs, library, program ] [ Propose Tags ]

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]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS],,,,
Change log changelog
Dependencies base (>= && <5.0), containers (>=0.3), directory, fgl (>=5.0), multiset (>=0.2), mwc-random (>=0.10) [details]
License Apache-2.0
Copyright Copyright (C) 2014 Uli Köhler
Author Uli Köhler
Category Graphs, Algorithms
Home page
Source repo head: git clone
Uploaded by ulikoehler at 2018-06-08T21:21:49Z
Distributions NixOS:
Reverse Dependencies 1 direct, 0 indirect [details]
Executables TestGen
Downloads 3992 total (8 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-06-08 [all 1 reports]

Readme for graph-generators-

[back to package description]


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

Generate sample DOT files by using:

cabal sandbox init
cabal install --only-dependencies
cabal exec runghc TestGen.hs # See output for location of graphs