The CyMeAlg Software (Release 0.01)
|
This header file contains several procedures directly related to the DFS algorithm. More...
#include "chomp/system/config.h"
Go to the source code of this file.
Namespaces | |
cymealg | |
Functions | |
template<class Graph , class Table > | |
void | cymealg::DFSfinishTimeRecurrent (const Graph &g, Table &tab, int_t vertex, int_t &counter) |
The recurrent procedure for DFSfinishTime. More... | |
template<class Graph , class Table > | |
void | cymealg::DFSfinishTimeStack (const Graph &g, Table &tab, int_t vertex, int_t &counter) |
A stack version of the recurrent procedure for DFSfinishTime. More... | |
template<class Graph , class Table > | |
void | cymealg::DFSfinishTime (const Graph &g, Table &tab) |
Computes the DFS finishing time for each vertex. More... | |
template<class Graph , class Table1 , class Table2 > | |
bool | cymealg::DFSforestRecurrent (const Graph &g, Table1 &tab, Table1 &ntab, int_t vertex, int_t treeNumber, int_t countTrees, Table2 &compVertices, int_t &curVertex, Graph *sccGraph, int_t *sccEdgeAdded) |
The recurrent procedure for DFSforest. More... | |
template<class Graph , class Table1 , class Table2 > | |
bool | cymealg::DFSforestStack (const Graph &g, Table1 &tab, Table1 &ntab, int_t vertex, int_t treeNumber, int_t countTrees, Table2 &compVertices, int_t &curVertex, Graph *sccGraph, int_t *sccEdgeAdded) |
A stack version of the recurrent procedure for DFSforest. More... | |
template<class Graph , class Table1 , class Table2 , class Table3 > | |
int_t | cymealg::DFSforest (const Graph &g, const Table1 &ordered, Table2 &compVertices, Table3 &compEnds, bool nontrivial=false, Graph *sccGraph=0) |
Computes the DFS forest. More... | |
template<class Graph , class Table , class Color > | |
void | cymealg::DFScolorRecurrent (const Graph &g, Table &tab, const Color &color, int_t vertex=0) |
The recurrent procedure for DFScolor. More... | |
template<class Graph , class Table , class Color > | |
void | cymealg::DFScolorStack (const Graph &g, Table &tab, const Color &color, int_t vertex=0) |
A stack version of the recurrent procedure for DFScolor. More... | |
template<class Graph , class Table , class Color > | |
void | cymealg::DFScolor (const Graph &g, Table &tab, const Color &color, int_t vertex=0) |
Marks each vertex visited by DFS with the given color, starting with the given vertex. More... | |
This header file contains several procedures directly related to the DFS algorithm.
Definition in file dfs.h.