- libghc-base-orphans-prof-0.9.2-d3cf3
- libghc-base-prof-4.18.2.1-8e81e
- libghc-containers-prof-0.6.7-7a228
- libghc-topograph-dev (= 1.0.1-1+b1)
- libghc-vector-prof-0.13.1.0-ca5d5
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: 221.2 kB
Architectures: arm64 amd64