Apocrypha

graphscc

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

Available in

OverlayNewestEbuildsLast activity
haskell GitHub ↗ 1.0.4 1 2 d details ›

Versions & arches

VersionOverlay amd64 Committed
1.0.4 haskell amd64 testing 6 mo view · download · history ↗

Use flags of 1.0.4

  • use-maps Use IntMap instead of mutable arrays.