On Oct 7, 2016, at 2:53 PM, Mika S <siddhupiddu@gmail.com> wrote:

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 ?

The documentation at that link says it’s based on DFS, and depth first search in BGL is iterative.

HTH

_______________________________________________
Boost-users mailing list
Boost-users@lists.boost.org
http://lists.boost.org/mailman/listinfo.cgi/boost-users

_______________________________________________
Boost-users mailing list
Boost-users@lists.boost.org
http://lists.boost.org/mailman/listinfo.cgi/boost-users