homepage: https://github.com/phadej/topograph
changelog-type: ''
hash: f6d21a9ba60e6909e5cf4665f4771a30f4c07728e982456160c7771408f5809d
test-bench-deps: {}
maintainer: Oleg.Grenrus <oleg.grenrus@iki.fi>
synopsis: Directed acyclic graphs.
changelog: ''
basic-deps:
  base: ! '>=4.6 && <4.15'
  base-orphans: ^>=0.8
  containers: ^>=0.5.0.0 || ^>=0.6.0.1
  base-compat: ^>=0.10.5 || ^>=0.11.0
  vector: ^>=0.12
all-versions:
- '1'
- 1.0.0.1
author: Oleg Grenrus <oleg.grenrus@iki.fi>
latest: 1.0.0.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 built-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: 33737f5b836100f0d7af7900cebfb9b4bf96796d1fed9181efa8a3294da877b1
test-bench-deps: {}
maintainer: Oleg.Grenrus <oleg.grenrus@iki.fi>
synopsis: Directed acyclic graphs.
changelog: ''
basic-deps:
  base: '>=4.6 && <4.16'
  base-orphans: ^>=0.8
  containers: ^>=0.5.0.0 || ^>=0.6.0.1
  base-compat: ^>=0.10.5 || ^>=0.11.0
  vector: ^>=0.12
all-versions:
- '1'
- 1.0.0.1
author: Oleg Grenrus <oleg.grenrus@iki.fi>
latest: 1.0.0.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 built-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 2021-02-20T21:44:12Z
Update from Hackage at 2021-02-20T21:44:12Z
