- libghc-base-compat-prof-0.11.2-0fbbb
- libghc-base-orphans-prof-0.8.7-51209
- libghc-base-prof-4.15.1.0-78aa1
- libghc-containers-prof-0.6.4.1-567e5
- libghc-topograph-dev (= 1.0.0.2-1+b1)
- libghc-vector-prof-0.12.3.1-64b75
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: 369.7 kB
Architectures: arm64 amd64