topograph: Directed acyclic graphs.

[ bsd3, data, graph, library ] [ Propose Tags ]

Directed acyclic graphs can be sorted topographically. Existence of topographic ordering allows writing many graph algorithms efficiently. And many graphs, e.g. most dependency graphs are acyclic!

There are some algorithms built-in: dfs, transpose, transitive closure, transitive reduction... Some algorithms even become not-so-hard to implement, like a longest path!

Versions [RSS] [faq] 1,
Dependencies base (>=4.6 && <4.17), base-compat (>=0.10.5 && <0.11 || >=0.11.0 && <0.12 || >=0.12.0 && <0.13), base-orphans (==0.8.*), containers (>= && <0.6 || >= && <0.7), vector (==0.12.*) [details]
License BSD-3-Clause
Copyright (c) 2018-2019 Oleg Grenrus
Author Oleg Grenrus <>
Maintainer Oleg.Grenrus <>
Revised Revision 3 made by phadej at 2022-01-03T11:46:57Z
Category Data, Graph
Home page
Bug tracker
Source repo head: git clone
Uploaded by phadej at 2020-03-27T07:00:53Z
Distributions Arch:, Fedora:, LTSHaskell:, NixOS:, Stackage:, openSUSE:
Downloads 3423 total (91 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2020-03-27 [all 1 reports]


[Index] [Quick Jump]


Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

For package maintainers and hackage trustees