Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::Kosaraju_Connected_Components< GT > Struct Template Reference

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.
 

Detailed Description

template<class GT>
struct Aleph::Kosaraju_Connected_Components< GT >

Functor wrapper for Kosaraju's algorithm.

This struct provides a callable interface for computing strongly connected components using Kosaraju's algorithm.

Template Parameters
GTGraph type (must be a directed graph).
See also
kosaraju_connected_components()
Author
Leandro Rabindranath León

Definition at line 342 of file kosaraju.H.

Member Function Documentation

◆ operator()() [1/2]

Compute SCCs returning lists of nodes.

Parameters
[in]gThe directed graph.
Returns
List of lists of nodes, one list per SCC.

Definition at line 362 of file kosaraju.H.

References Aleph::kosaraju_connected_components().

◆ operator()() [2/2]

template<class GT >
void Aleph::Kosaraju_Connected_Components< GT >::operator() ( const GT g,
DynList< GT > &  blk_list,
DynList< typename GT::Arc * > &  arc_list 
) const
inline

Compute SCCs returning subgraphs and cross-arcs.

Parameters
[in]gThe directed graph.
[out]blk_listList of SCC subgraphs.
[out]arc_listList of inter-component arcs.

Definition at line 350 of file kosaraju.H.

References Aleph::kosaraju_connected_components(), and Aleph::maps().


The documentation for this struct was generated from the following file: