haskell-graphscc 1.0.4-5 source package in Ubuntu

Changelog

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

  [ Clint Adams ]
  * Set Rules-Requires-Root to no.

  [ Ilias Tsitsimpis ]
  * Bump debhelper compat level to 10

 -- Ilias Tsitsimpis <email address hidden>  Sun, 30 Sep 2018 21:09:59 +0300

Upload details

Uploaded by:
Debian Haskell Group on 2018-10-01
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
Disco release on 2018-12-20 universe misc

Downloads

File Size SHA-256 Checksum
haskell-graphscc_1.0.4-5.dsc 2.3 KiB 711d8f92287efd07e2c79fd4e8cec224020529ef92db30880e20aee2c6313fe9
haskell-graphscc_1.0.4.orig.tar.gz 4.2 KiB 789d93e6188845f009779b1c800b043f524587a21d324be8594d09b0f8e86cf1
haskell-graphscc_1.0.4-5.debian.tar.xz 2.3 KiB a66b93b439c9492a1eb188756cc79e9b6c8d0544e98f5a117d157c21b07e50e3

Available diffs

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.