|
|
Boost Users : |
Subject: [Boost-users] graph strongly connected components
From: Mika S (siddhupiddu_at_[hidden])
Date: 2016-10-07 16:53:05
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
?
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net