haskell-topograph 1.0.0.2-1build1 source package in Ubuntu
Changelog
haskell-topograph (1.0.0.2-1build1) lunar; urgency=medium * Rebuild against new GHC ABI. -- Gianfranco Costamagna <email address hidden> Sun, 11 Dec 2022 05:47:00 +0100
Upload details
- Uploaded by:
- Gianfranco Costamagna
- Uploaded to:
- Lunar
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Mantic | release | universe | misc | |
Lunar | 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-1build1.debian.tar.xz | 2.4 KiB | 5faa66e4993150e00118e6bcd3d259c72734985b62e13d8917f54a057a39dbb8 |
haskell-topograph_1.0.0.2-1build1.dsc | 2.4 KiB | 6acb9acba69d6bad108f59d8260974412cfe45008c2553345b779258dac68420 |
Available diffs
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.