GraphSCC: Tarjan's algorithm for computing the strongly connected components of a graph.

[ algorithms, bsd3, library ] [ Propose Tags ]

Tarjan's algorithm for computing the strongly connected components of a graph.

Versions 1.0, 1.0.1, 1.0.2, 1.0.3, 1.0.4
Dependencies array, base, containers [details]
License BSD-3-Clause
Author Iavor S. Diatchki
Maintainer diatchki@galois.com
Category Algorithms
Uploaded by IavorDiatchki at Fri Sep 26 19:25:42 UTC 2008
Distributions Arch:1.0.4, Debian:1.0.4, NixOS:1.0.4, openSUSE:1.0.4
Downloads 3934 total (47 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Flags

NameDescriptionDefaultType
use-maps

Use IntMap instead of mutable arrays.

DisabledAutomatic

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

For package maintainers and hackage trustees