libghc-topograph-dev binary package in Ubuntu Lunar s390x
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://
Publishing history
Date | Status | Target | Component | Section | Priority | Phased updates | Version | ||
---|---|---|---|---|---|---|---|---|---|
2022-12-28 04:09:00 UTC | Published | Ubuntu Lunar s390x | release | universe | haskell | Optional | 1.0.0.2-1build1 | ||
|
|||||||||
Deleted | Ubuntu Lunar s390x | proposed | universe | haskell | Optional | 1.0.0.2-1build1 | |||
|
|||||||||
2022-12-28 04:21:16 UTC | Superseded | Ubuntu Lunar s390x | release | universe | haskell | Optional | 1.0.0.1-2 | ||
|