Package Info

ghc-topograph


Directed acyclic graphs


Unspecified

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: BSD-3-Clause
URL: https://hackage.haskell.org/package/topograph

Categories

Releases

Package Version Update ID Released Package Hub Version Platforms Subpackages
1.0.0.1-bp155.3.14 info GA Release 2023-05-22 15 SP5
  • AArch64
  • ppc64le
  • s390x
  • x86-64
  • ghc-topograph
  • ghc-topograph-devel
1.0.0.1-bp154.2.12 info GA Release 2022-05-09 15 SP4
  • AArch64
  • ppc64le
  • x86-64
  • ghc-topograph
  • ghc-topograph-devel