Paket: libghc-topograph-doc (1.0.0.2-2)

[ Källkod: haskell-topograph  ]

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-41

  virtuellt paket som tillhandahålls av ghc

• rec: ghc-doc

  Documentation for the Glasgow Haskell Compilation system

• rec: libghc-base-compat-doc

  compatibility layer for base; documentation

• 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

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Paketstorlek	Installerad storlek	Filer
all	86,4 kbyte	451,0 kbyte	[filförteckning]