haskell-graphscc 1.0.4-8 source package in Ubuntu

Changelog

haskell-graphscc (1.0.4-8) unstable; urgency=medium

  * Declare compliance with Debian policy 4.6.2
  * Sourceful upload for GHC 9.4

 -- Ilias Tsitsimpis <email address hidden>  Sun, 27 Aug 2023 12:39:52 +0300

Upload details

Uploaded by:
Debian Haskell Group
Uploaded to:
Sid
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
Noble release universe misc

Downloads

File Size SHA-256 Checksum
haskell-graphscc_1.0.4-8.dsc 2.3 KiB 6bf8e59c50d3178c514bcf1476676ae5b9effbeee12c4bd518934405c44c026f
haskell-graphscc_1.0.4.orig.tar.gz 4.2 KiB 789d93e6188845f009779b1c800b043f524587a21d324be8594d09b0f8e86cf1
haskell-graphscc_1.0.4-8.debian.tar.xz 2.4 KiB a34547c7ecf40e5e2ac7052fe1e4579731ac2b38b33b88892cf587bbdbe11a10

No changes file available.

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.