@hackage / topograph

Directed acyclic graphs.

1

About

Metadata

  • Last updated , by phadej
  • License BSD-3-Clause
  • Categories Mathematics

  • Maintained by: Oleg.Grenrus <oleg.grenrus@iki.fi>

  • Lottery factor: 1

Links

Installation

Tested Compilers

  1. 8.8.1
  2. 8.6.5
  3. 8.4.4
  4. 8.2.2
  5. 8.0.2
  6. 7.10.3

Readme

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!