The CyMeAlg Software (Release 0.01)
|
This header file contains implementation of a selection of various graph algorithms. More...
#include "chomp/system/config.h"
Go to the source code of this file.
Namespaces | |
cymealg | |
Functions | |
template<class wType > | |
int_t | cymealg::addRenumEdges (const diGraph< wType > &g, int_t vertex, const int_t *newNum, int_t cur, int_t *srcVert, diGraph< wType > &result) |
A helper function for "collapseVertices". More... | |
template<class wType , class Table1 , class Table2 > | |
int_t | cymealg::collapseVertices (const diGraph< wType > &g, int_t compNum, Table1 &compVertices, Table2 &compEnds, diGraph< wType > &result, int_t *newNumbers=0) |
Collapses disjoint subsets of vertices to single vertices and creates a corresponding graph in which the first vertices come from the collapsed ones. More... | |
template<class wType , class TabSets > | |
int_t | cymealg::addRenumEdges2 (const diGraph< wType > &g, int_t vertex, const int_t *newNum, TabSets &numSets, int_t cur, int_t *srcVert, diGraph< wType > &result) |
A helper function for "collapseVertices2". More... | |
template<class wType , class Table1 , class Table2 > | |
int_t | cymealg::collapseVertices2 (const diGraph< wType > &g, int_t compNum, Table1 &compVertices, Table2 &compEnds, diGraph< wType > &result) |
Collapses (possibly non-disjoint) subsets of vertices to single vertices and creates a corresponding graph in which the first vertices come from the collapsed ones. More... | |
template<class wType > | |
int_t | cymealg::connectionGraph (const diGraph< wType > &g, int_t nVert, diGraph< wType > &result) |
Computes the graph that represents connections between a number of the first vertices in the given graph. More... | |
template<class GraphType > | |
int_t | cymealg::computePeriod (const GraphType &g) |
Computes the period of a strongly connected graph. More... | |
template<class wType > | |
int_t | cymealg::inclusionGraph (const diGraph< wType > &g, int_t nVert, diGraph< wType > &result) |
Computes the graph that represents flow-induced relations on Morse sets. More... | |
template<class wType , class TConn > | |
int_t | cymealg::inclusionGraph (const diGraph< wType > &g, int_t nVert, diGraph< wType > &result, TConn &connections) |
A more complicated version of the 'inclusionGraph' function. More... | |
template<class wType , class matrix > | |
void | cymealg::graph2matrix (const diGraph< wType > &g, matrix &m) |
Creates the adjacency matrix of the given graph. More... | |
template<class wType , class matrix > | |
void | cymealg::matrix2graph (const matrix &m, int_t n, diGraph< wType > &g) |
Creates a graph based on the given adjacency matrix. More... | |
template<class matrix > | |
void | cymealg::transitiveClosure (matrix &m, int_t n) |
Computes the transitive closure of an acyclic graph defined by its adjacency matrix, using the Warshall's algorithm: S. More... | |
template<class matrix > | |
void | cymealg::transitiveReduction (matrix &m, int_t n) |
Computes the transitive reduction of a CLOSED acyclic graph defined by its adjacency matrix, using the algorithm by D. More... | |
template<class wType > | |
void | cymealg::transitiveReduction (const diGraph< wType > &g, diGraph< wType > &gRed) |
Computes the transitive reduction of an arbitrary acyclic graph. More... | |
This header file contains implementation of a selection of various graph algorithms.
Definition in file various.h.