Ubuntu
haskell-topograph package

haskell-topograph 1.0.0.2-2build1 source package in Ubuntu

Changelog

haskell-topograph (1.0.0.2-2build1) oracular; urgency=medium

  * Rebuild against new GHC ABIs.

 -- Gianfranco Costamagna <email address hidden>  Wed, 15 May 2024 11:10:03 +0200

Upload details

Uploaded by:
Gianfranco Costamagna
Uploaded to:
Oracular
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Oracular release universe misc

Downloads

File Size SHA-256 Checksum
haskell-topograph_1.0.0.2.orig.tar.gz 39.4 KiB d19e45680a8b6938e91f641096ddb6c879473f025af3688f532f90619ce2d721
haskell-topograph_1.0.0.2-2build1.debian.tar.xz 2.8 KiB 169fb8395968591b0ad834ae95654fad26e351ca1884c64abf91e12d656fb305
haskell-topograph_1.0.0.2-2build1.dsc 2.4 KiB 688a677fe9377985921b83a8880e181fd94f7a7c791fafef6b9ab5bde1db8264

View changes file

Binary packages built by this source

libghc-topograph-dev: 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-doc: 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.

libghc-topograph-prof: 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.