homepage: https://github.com/phadej/topograph
changelog-type: ''
hash: 1f681a1f0befcf8eaa1b3f0a010b6086248d05ac6100f771a1f89c1ceb5a9790
test-bench-deps: {}
maintainer: Oleg.Grenrus <oleg.grenrus@iki.fi>
synopsis: Directed acyclic graphs.
changelog: ''
basic-deps:
  base: '>=4.6 && <4.17'
  base-orphans: ^>=0.8
  containers: ^>=0.5.0.0 || ^>=0.6.0.1
  base-compat: ^>=0.10.5 || ^>=0.11.0 || ^>=0.12.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: 663c10bcd77a871bf41e0e856c03e13384018998b4694400f9b827ee1761f316
test-bench-deps: {}
maintainer: Oleg.Grenrus <oleg.grenrus@iki.fi>
synopsis: Directed acyclic graphs.
changelog: ''
basic-deps:
  base: '>=4.6 && <4.17'
  base-orphans: ^>=0.8
  containers: ^>=0.5.0.0 || ^>=0.6.0.1
  base-compat: ^>=0.10.5 || ^>=0.11.0 || ^>=0.12.0
  vector: ^>=0.12 || ^>=0.13
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 2022-06-20T17:57:57Z
Update from Hackage at 2022-06-20T17:57:57Z
