Package: libghc-topograph-prof (1.0.0.2-2 and others) [debports]

[ Source:  ]

directed acyclic graphs; profiling libraries

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.

Other Packages Related to libghc-topograph-prof

• dep: libghc-base-compat-prof-0.12.3-6dc1c

  virtual package provided by libghc-base-compat-prof

• dep: libghc-base-orphans-prof-0.9.1-68b56

  virtual package provided by libghc-base-orphans-prof

• dep: libghc-base-prof-4.17.2.0-09ce5

  virtual package provided by ghc-prof

• dep: libghc-containers-prof-0.6.7-a1650

  virtual package provided by ghc-prof

• dep: libghc-topograph-dev (= 1.0.0.2-2+b1)

  directed acyclic graphs

• dep: libghc-vector-prof-0.13.1.0-123f2

  virtual package provided by libghc-vector-prof

Download libghc-topograph-prof

Download for all available architectures

Architecture	Version	Package Size	Installed Size	Files
alpha (unofficial port)	1.0.0.2-2+b1	50.1 kB	384.0 kB	[list of files]