All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Public Member Functions | List of all members
NetworKit::StronglyConnectedComponents Class Reference

Determines the strongly connected components of an directed graph. More...

#include <StronglyConnectedComponents.h>

Public Member Functions

 StronglyConnectedComponents (const Graph &G, bool iterativeAlgo=true)
 
void run ()
 This method determines the connected components for the graph g (by default: iteratively). More...
 
void runIteratively ()
 This method determines the connected components for the graph g (iterative implementation). More...
 
void runRecursively ()
 This method determines the connected components for the graph g (recursive implementation). More...
 
count numberOfComponents ()
 This method returns the number of connected components. More...
 
count componentOfNode (node u)
 This method returns the the component in which node query is situated. More...
 
Partition getPartition ()
 Return a Partition that represents the components. More...
 

Detailed Description

Determines the strongly connected components of an directed graph.

Constructor & Destructor Documentation

NetworKit::StronglyConnectedComponents::StronglyConnectedComponents ( const Graph G,
bool  iterativeAlgo = true 
)

Member Function Documentation

count NetworKit::StronglyConnectedComponents::componentOfNode ( node  u)

This method returns the the component in which node query is situated.

Parameters
[in]querythe node whose component is asked for
Partition NetworKit::StronglyConnectedComponents::getPartition ( )

Return a Partition that represents the components.

count NetworKit::StronglyConnectedComponents::numberOfComponents ( )

This method returns the number of connected components.

void NetworKit::StronglyConnectedComponents::run ( )

This method determines the connected components for the graph g (by default: iteratively).

void NetworKit::StronglyConnectedComponents::runIteratively ( )

This method determines the connected components for the graph g (iterative implementation).

void NetworKit::StronglyConnectedComponents::runRecursively ( )

This method determines the connected components for the graph g (recursive implementation).


The documentation for this class was generated from the following files: