Re: [Boost-users] [EXTERNAL] graph strongly connected components

Subject: Re: [Boost-users] [EXTERNAL] graph strongly connected components
From: Belcourt, Kenneth (kbelco_at_[hidden])
Date: 2016-10-07 17:19:10

On Oct 7, 2016, at 2:53 PM, Mika S <siddhupiddu_at_[hidden]<mailto:siddhupiddu_at_[hidden]>> 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_at_[hidden]<mailto:Boost-users_at_[hidden]>
http://lists.boost.org/mailman/listinfo.cgi/boost-users