I am trying to use the implementation for strongly connected components http://www.boost.org/doc/libs/1_61_0/libs/graph/doc/strong_components.html


Is this the iterative or the recursive implementation of tarjan's algorithm ?