Paket: libghc-topograph-doc (1.0.1-1)
Länkar för libghc-topograph-doc
Debianresurser:
Hämta källkodspaketet haskell-topograph:
- [haskell-topograph_1.0.1-1.dsc]
- [haskell-topograph_1.0.1.orig.tar.gz]
- [haskell-topograph_1.0.1-1.debian.tar.xz]
Ansvariga:
Externa resurser:
- Hemsida [github.com]
Liknande paket:
directed acyclic graphs; documentation
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 the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
Andra paket besläktade med libghc-topograph-doc
|
|
|
|
-
- dep: haddock-interface-42
- virtuellt paket som tillhandahålls av ghc
-
- rec: ghc-doc
- Documentation for the Glasgow Haskell Compilation system
-
- rec: libghc-base-orphans-doc
- Backwards-compatible orphan instances for base; documentation
-
- rec: libghc-topograph-dev
- directed acyclic graphs
-
- rec: libghc-vector-doc
- Efficient Arrays for Haskell; documentation
-
- rec: libjs-mathjax
- JavaScript display engine for LaTeX and MathML
-
- sug: libghc-topograph-prof
- directed acyclic graphs; profiling libraries
Hämta libghc-topograph-doc
Arkitektur | Paketstorlek | Installerad storlek | Filer |
---|---|---|---|
all | 86,6 kbyte | 457,0 kbyte | [filförteckning] |