homepage: https://github.com/kadena-io/digraph
changelog-type: markdown
hash: 580ca8b308cc8ab35deed230e8fb052dd2c2120ac1c0487e3e4b3f3c209e170e
test-bench-deps:
  base: ! '>=4.10 && <4.14'
  massiv: ! '>=0.3'
  fgl: ! '>=5.7'
  hashable: ! '>=1.3'
  QuickCheck: ! '>=2.11'
  digraph: -any
maintainer: lars@kadena.io
synopsis: Directed Graphs
changelog: |
  # Revision history for digraph

  ## 0.1.0.0 -- 2019-05-30

  * First version. Released on an unsuspecting world.
basic-deps:
  streaming: ! '>=0.2'
  mwc-random: ! '>=0.14'
  base: ! '>=4.10 && <4.14'
  unordered-containers: ! '>=0.2'
  massiv: ! '>=0.3'
  containers: ! '>=0.5'
  hashable: ! '>=1.3'
  transformers: ! '>=0.5'
  deepseq: ! '>=1.4'
all-versions:
- 0.1.0.0
author: Lars Kuhtz
latest: 0.1.0.0
description-type: markdown
description: |+
  [![Build Status](https://travis-ci.org/kadena-io/digraph.svg?branch=master)](https://travis-ci.org/kadena-io/digraph)

  Directed graphs in adjacency set representation. The implementation is based
  on `Data.HashMap.Strict` and `Data.HashSet` from the [unordered-containers
  package](https://hackage.haskell.org/package/unordered-containers).

  Undirected graphs are represented as symmetric, irreflexive directed graphs.

license-name: BSD-3-Clause

Update from Hackage at 2019-05-31T18:19:28Z
Update from Hackage at 2019-05-31T18:19:28Z
