- libghc-base-compat-prof-0.12.3-6dc1c
- libghc-base-orphans-prof-0.9.1-68b56
- libghc-base-prof-4.17.2.0-68dfe
- libghc-containers-prof-0.6.7-a1650
- libghc-topograph-dev (= 1.0.0.2-2+b2)
- libghc-vector-prof-0.13.1.0-1ffee
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: 233.5 kB
Architectures: arm64 amd64