Package: libghc-topograph-dev
Source: haskell-topograph
Version: 1.0.1-2
Architecture: amd64
Architecture-Variant: amd64v3
Maintainer: Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
Original-Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Installed-Size: 244
Depends: libghc-base-dev-4.20.2.0-47ff0, libghc-base-orphans-dev-0.9.3-a64b4, libghc-containers-dev-0.7-0c6d4, libghc-vector-dev-0.13.2.0-57b80, libc6 (>= 2.14), libgmp10 (>= 2:6.3.0+dfsg)
Provides: libghc-topograph-dev-1.0.1-73730
Section: haskell
Priority: optional
Homepage: https://github.com/phadej/topograph
Description: 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.
Ghc-Package: topograph-1.0.1-1Mq8Ors43mvALAZFI8ElWJ
