topograph

Directed acyclic graphs.

https://github.com/phadej/topograph

Version on this page:1.0.0.2@rev:2
LTS Haskell 24.23:1.0.1@rev:1
Stackage Nightly 2025-12-10:1.0.1@rev:1
Latest on Hackage:1.0.1@rev:1

See all snapshots topograph appears in

BSD-3-Clause licensed by Oleg Grenrus
Maintained by Oleg.Grenrus
This version can be pinned in stack with:topograph-1.0.0.2@sha256:8697101dd2d3b4605320df4dec1781fd08ff631b0d1037d9b5c9073f73a028d1,1738

Module documentation for 1.0.0.2

Used by 1 package in lts-22.11(full list with versions):
cabal-plan

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!