homepage: https://github.com/phadej/topograph
changelog-type: ''
hash: 484fe035abb118c06603a299c43d12e5d5d58eb05825e73de946e65c5226ea4d
test-bench-deps: {}
maintainer: Oleg.Grenrus <oleg.grenrus@iki.fi>
synopsis: Directed acyclic graphs.
changelog: ''
basic-deps:
  base: ! '>=4.6 && <4.13'
  base-orphans: ^>=0.8
  containers: ^>=0.5.0.0 || ^>=0.6.0.1
  base-compat: ^>=0.10.5
  vector: ^>=0.12
all-versions:
- '1'
author: Oleg Grenrus <oleg.grenrus@iki.fi>
latest: '1'
description-type: haddock
description: |-
  Directed acyclic graphs can be sorted topographically.
  Existence of topographic ordering allows writing many graph algorithms efficiently.
  And many graphs, e.g. most dependency graphs are acyclic!

  There are some algorithms build-in: dfs, transpose, transitive closure,
  transitive reduction...
  Some algorithms even become not-so-hard to implement, like a longest path!
license-name: BSD-3-Clause

homepage: https://github.com/phadej/topograph
changelog-type: ''
hash: 0cbfeeeccf8e2de0f8a914d33f6aa3e99adfe51a347419563f24315abf94fb5d
test-bench-deps: {}
maintainer: Oleg.Grenrus <oleg.grenrus@iki.fi>
synopsis: Directed acyclic graphs.
changelog: ''
basic-deps:
  base: ! '>=4.6 && <4.14'
  base-orphans: ^>=0.8
  containers: ^>=0.5.0.0 || ^>=0.6.0.1
  base-compat: ^>=0.10.5
  vector: ^>=0.12
all-versions:
- '1'
author: Oleg Grenrus <oleg.grenrus@iki.fi>
latest: '1'
description-type: haddock
description: |-
  Directed acyclic graphs can be sorted topographically.
  Existence of topographic ordering allows writing many graph algorithms efficiently.
  And many graphs, e.g. most dependency graphs are acyclic!

  There are some algorithms build-in: dfs, transpose, transitive closure,
  transitive reduction...
  Some algorithms even become not-so-hard to implement, like a longest path!
license-name: BSD-3-Clause

Update from Hackage at 2019-09-01T18:49:32Z
Update from Hackage at 2019-09-01T18:49:32Z
