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

Subject: Re: [Boost-users] [EXTERNAL] graph strongly connected components
From: Mika S (siddhupiddu_at_[hidden])
Date: 2016-10-07 17:27:39

Thanks. I also did find the source code which confirms what you said :

http://www.boost.org/doc/libs/1_52_0/boost/graph/depth_first_search.hpp

Their is code for recursive but it is guarded by an ifdef

On Fri, Oct 7, 2016 at 2:19 PM, Belcourt, Kenneth <kbelco_at_[hidden]> wrote:

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