name: graph-generators version: 0.1.2.0 synopsis: Functions for generating structured or random FGL graphs description: 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. homepage: https://github.com/ulikoehler/graph-random license: Apache-2.0 license-file: LICENSE author: Uli Köhler maintainer: ukoehler@techoverflow.net copyright: Copyright (C) 2014 Uli Köhler category: Graphs, Algorithms build-type: Simple extra-source-files: README.md changelog cabal-version: >=1.10 source-repository head type: git location: https://github.com/ulikoehler/graph-generators library exposed-modules: Data.Graph.Generators, Data.Graph.Generators.Classic, Data.Graph.Generators.Regular, Data.Graph.Generators.FGL, Data.Graph.Generators.Random.ErdosRenyi, Data.Graph.Generators.Random.BarabasiAlbert -- other-modules: -- other-extensions: build-depends: base >= 4.2 && < 4.8, containers >= 0.3, mwc-random >= 0.10, fgl >= 5.0, multiset >= 0.2 -- hs-source-dirs: default-language: Haskell2010 Test-Suite test-graph-generators type: exitcode-stdio-1.0 main-is: GraphGeneratorsTest.hs default-language: Haskell2010 build-depends: base, Cabal >= 1.9.2, hspec, hspec-expectations, containers >= 0.3, fgl, QuickCheck, multiset >= 0.2, mwc-random