Tarjan's algorithm for computing the SCCs of a graph; profiling libraries

 Tarjan's algorithm for computing the strongly connected components of
 a graph.
 .
 This package provides a library for the Haskell programming language, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.