topograph

Directed acyclic graphs.

Version on this page:	1.0.0.1@rev:3
LTS Haskell 20.23:	1.0.0.2@rev:1
Stackage Nightly 2023-05-30:	1.0.0.2@rev:1
Latest on Hackage:	1.0.0.2@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.1@sha256:1f681a1f0befcf8eaa1b3f0a010b6086248d05ac6100f771a1f89c1ceb5a9790,1660

Module documentation for 1.0.0.1

Topograph

Depends on 5 packages(full list with versions):

base, base-compat, base-orphans, containers, vector

Used by 1 package in lts-18.28(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!