Directed acyclic graphs.
|Version on this page:||1@rev:2|
|LTS Haskell 20.23:||188.8.131.52@rev:1|
|Stackage Nightly 2023-05-31:||184.108.40.206@rev:1|
|Latest on Hackage:||220.127.116.11@rev:1|
Maintained by Oleg.Grenrus
This version can be pinned in stack with:
Module documentation for 1
Depends on 5 packages(full list with versions):
Used by 1 package in lts-15.3(full list with versions):
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 build-in: dfs, transpose, transitive closure, transitive reduction... Some algorithms even become not-so-hard to implement, like a longest path!