软件包:libghc-topograph-dev(1.0.0.2-2 以及其他的) [debports]
directed acyclic graphs
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. See http://www.haskell.org/ for more information on Haskell.
其他与 libghc-topograph-dev 有关的软件包
|
|
|
|
-
- dep: libc6.1 (>= 2.1.3)
- GNU C 语言运行库:共享库
同时作为一个虚包由这些包填实: libc6.1-udeb
-
- dep: libghc-base-compat-dev-0.12.3-6dc1c
- 本虚包由这些包填实: libghc-base-compat-dev
-
- dep: libghc-base-dev-4.17.2.0-09ce5
- 本虚包由这些包填实: ghc
-
- dep: libghc-base-orphans-dev-0.9.1-68b56
- 本虚包由这些包填实: libghc-base-orphans-dev
-
- dep: libghc-containers-dev-0.6.7-a1650
- 本虚包由这些包填实: ghc
-
- dep: libghc-vector-dev-0.13.1.0-123f2
- 本虚包由这些包填实: libghc-vector-dev
-
- dep: libgmp10 (>= 2:6.3.0+dfsg)
- 多精度运算库