Ubuntu
haskell-graphscc package

haskell-graphscc 1.0.4-8build1 source package in Ubuntu

Changelog

haskell-graphscc (1.0.4-8build1) oracular; urgency=medium

  * Rebuild against new GHC ABIs.

 -- Gianfranco Costamagna <email address hidden>  Wed, 15 May 2024 10:21:37 +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-graphscc_1.0.4.orig.tar.gz 4.2 KiB 789d93e6188845f009779b1c800b043f524587a21d324be8594d09b0f8e86cf1
haskell-graphscc_1.0.4-8build1.debian.tar.xz 2.4 KiB fc3812346c0d4b5e37f82a38c6982a0b32ee63621b7bbe49c0930879f4734946
haskell-graphscc_1.0.4-8build1.dsc 2.3 KiB 7606da18bac645c19ced099d8064688a1f04ab935ef8558a81ed2d8518c02091

View changes file

Binary packages built by this source

libghc-graphscc-dev: Tarjan's algorithm for computing the SCCs of a graph

 Tarjan's algorithm for computing the strongly connected components of
 a graph.
 .
 This package provides a library for the Haskell programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-graphscc-doc: Tarjan's algorithm for computing the SCCs of a graph; documentation

 Tarjan's algorithm for computing the strongly connected components of
 a graph.
 .
 This package provides the documentation for a library for the Haskell
 programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-graphscc-prof: Tarjan's algorithm for computing the SCCs of a graph; profiling libraries

 Tarjan's algorithm for computing the strongly connected components of
 a graph.
 .
 This package provides a library for the Haskell programming language, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.