topograph: Directed acyclic graphs.

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!

Modules

[Index] [Quick Jump]

Downloads

• topograph-1.0.1.tar.gz [browse] (Cabal source package)
• Package description (as included in the package)

Maintainer's Corner

Package maintainers

• phadej

For package maintainers and hackage trustees

• edit package information

Candidates

• 1, 1.0.0.1