topograph: Directed acyclic graphs.

[ bsd3, data, graph, library ] [ Propose Tags ]

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!

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates

Versions [RSS] 1, 1.0.0.1, 1.0.0.2
Dependencies base (>=4.6 && <4.18), base-compat (>=0.10.5 && <0.11 || >=0.11.0 && <0.12 || >=0.12.0 && <0.13), base-orphans (>=0.8 && <0.9), containers (>=0.5.0.0 && <0.6 || >=0.6.0.1 && <0.7), vector (>=0.12 && <0.14) [details]
License BSD-3-Clause
Copyright (c) 2018-2019 Oleg Grenrus
Author Oleg Grenrus <oleg.grenrus@iki.fi>
Maintainer Oleg.Grenrus <oleg.grenrus@iki.fi>
Category Data, Graph
Home page https://github.com/phadej/topograph
Bug tracker https://github.com/phadej/topograph/issues
Source repo head: git clone https://github.com/phadej/topograph.git
Uploaded by phadej at 2022-08-21T16:22:57Z
Distributions Arch:1.0.0.2, Fedora:1.0.0.1, LTSHaskell:1.0.0.2, NixOS:1.0.0.2, Stackage:1.0.0.2, openSUSE:1.0.0.1
Downloads 4248 total (81 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2022-08-21 [all 1 reports]