topograph: Directed acyclic graphs.

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

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 also become even not-so-hard to implement, like the longest path!


Versions 1, 1,,
Change log None available
Dependencies base (>=4.6 && <4.13), base-compat (>=0.10.5 && <0.11), base-orphans (>=0.8 && <0.9), containers (>= && <0.6 || >= && <0.7), vector (>=0.12 && <0.13) [details]
License BSD-3-Clause
Copyright (c) 2018-2019 Oleg Grenrus
Author Oleg Grenrus <>
Maintainer Oleg.Grenrus <>
Category Data, Graph
Home page
Bug tracker
Source repo head: git clone
Uploaded by phadej at 2019-03-11T19:14:59Z


[Index] [Quick Jump]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees