|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Functor wrapper for Kosaraju's algorithm. More...
#include <kosaraju.H>
Public Member Functions | |
| void | operator() (const GT &g, DynList< GT > &blk_list, DynList< typename GT::Arc * > &arc_list) const |
| Compute SCCs returning subgraphs and cross-arcs. | |
| DynList< DynList< typename GT::Node * > > | operator() (const GT &g) const |
| Compute SCCs returning lists of nodes. | |
Functor wrapper for Kosaraju's algorithm.
This struct provides a callable interface for computing strongly connected components using Kosaraju's algorithm.
| GT | Graph type (must be a directed graph). |
Definition at line 342 of file kosaraju.H.
|
inline |
Compute SCCs returning lists of nodes.
| [in] | g | The directed graph. |
Definition at line 362 of file kosaraju.H.
References Aleph::kosaraju_connected_components().
|
inline |
Compute SCCs returning subgraphs and cross-arcs.
| [in] | g | The directed graph. |
| [out] | blk_list | List of SCC subgraphs. |
| [out] | arc_list | List of inter-component arcs. |
Definition at line 350 of file kosaraju.H.
References Aleph::kosaraju_connected_components(), and Aleph::maps().