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 build-in: dfs, transpose, transitive closure, transitive reduction... Some algorithms even become not-so-hard to implement, like a longest path!

Versions [faq] 1, 1.0.0.1
Dependencies base (>=4.6 && <4.14), base-compat (>=0.10.5 && <0.11 || >=0.11.0 && <0.12), base-orphans (==0.8.*), containers (>=0.5.0.0 && <0.6 || >=0.6.0.1 && <0.7), vector (==0.12.*) [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>
Revised Revision 2 made by phadej at 2019-09-10T06:17:29Z
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 2019-03-11T19:35:03Z
Distributions NixOS:1.0.0.1
Downloads 1113 total (212 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index] [Quick Jump]

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

For package maintainers and hackage trustees