- libghc-topograph-dev (= 1.0.0.1-1+b1)
- libghc-base-prof-4.13.0.0-d4e5b
- libghc-base-compat-prof-0.11.1-10d6a
- libghc-base-orphans-prof-0.8.2-50da5
- libghc-containers-prof-0.6.2.1-39f42
- libghc-vector-prof-0.12.1.2-81dc0
Directed acyclic graphs can be sorted topographically.
Existence of topographic ordering allows writing many graph
algorithms efficiently. Many graphs, including most
dependency graphs, are acyclic.
.
There are some algorithms built in: dfs, transpose, transitive
closure, transitive reduction, etc.
.
This package provides a library for the Haskell programming language, compiled
for profiling. See http://www.haskell.org/ for more information on Haskell.
Installed Size: 262.1 kB
Architectures: amd64 arm64