The CyMeAlg Software (Release 0.01)
|
This header file contains the implementation of two algorithms for the computation of strongly connected path components of a digraph. More...
#include <stack>
#include <vector>
#include "chomp/system/config.h"
#include "chomp/struct/bitfield.h"
#include "cymealg/transpose.h"
#include "cymealg/dfs.h"
Go to the source code of this file.
Namespaces | |
cymealg | |
Functions | |
template<class wType , class Table1 , class Table2 > | |
int_t | cymealg::SCC (const diGraph< wType > &g, Table1 &compVertices, Table2 &compEnds, diGraph< wType > *scc=0, diGraph< wType > *transposed=0, bool copyweights=false) |
Computes strongly connected path components of the graph 'g'. More... | |
template<class wType , class Table1 , class Table2 > | |
int_t | cymealg::SCC_Tarjan (const diGraph< wType > &g, Table1 &compVertices, Table2 &compEnds) |
Computes strongly connected components of the graph 'g' using Tarjan's algorithm (as described in the Wikipedia). More... | |
This header file contains the implementation of two algorithms for the computation of strongly connected path components of a digraph.
Definition in file scc.h.