The CyMeAlg Software (Release 0.01)
cymealg::diGraph< wType > Member List

This is the complete list of members for cymealg::diGraph< wType >, including all inherited members.

addEdge(int_t target)cymealg::diGraph< wType >inline
addEdge(int_t target, const wType &weight)cymealg::diGraph< wType >inline
addVertex(void)cymealg::diGraph< wType >inline
BellmanFord(const roundType &rounding, int_t source, lenTable &len, wType *infinity, predTable pred) constcymealg::diGraph< wType >inline
BellmanFord(int_t source, lenTable &len, wType *infinity, predTable pred) constcymealg::diGraph< wType >inline
BellmanFord(const roundType &rounding, int_t source) constcymealg::diGraph< wType >inline
BellmanFord(int_t source) constcymealg::diGraph< wType >inline
countEdges(void) constcymealg::diGraph< wType >inline
countEdges(int_t vertex) constcymealg::diGraph< wType >inline
countVertices(void) constcymealg::diGraph< wType >inline
DFScolor(Table &tab, const Color &color, int_t vertex=0) constcymealg::diGraph< wType >inline
DFScolorRecurrent(Table &tab, const Color &color, int_t vertex=0) constcymealg::diGraph< wType >inline
DFScolorStack(Table &tab, const Color &color, int_t vertex=0) constcymealg::diGraph< wType >inline
DFSfinishTime(Table &tab) constcymealg::diGraph< wType >inline
DFSfinishTimeRecurrent(Table &tab, int_t vertex, int_t &counter) constcymealg::diGraph< wType >inline
DFSfinishTimeStack(Table &tab, int_t vertex, int_t &counter) constcymealg::diGraph< wType >inline
DFSforest(const Table1 &ordered, Table2 &compVertices, Table3 &compEnds, bool nontrivial=false, diGraph< wType > *sccGraph=0) constcymealg::diGraph< wType >inline
DFSforestRecurrent(Table1 &tab, Table1 &ntab, int_t vertex, int_t treeNumber, int_t countTrees, Table2 &compVertices, int_t &curVertex, diGraph *sccGraph, int_t *sccEdgeAdded) constcymealg::diGraph< wType >inline
DFSforestStack(Table1 &tab, Table1 &ntab, int_t vertex, int_t treeNumber, int_t countTrees, Table2 &compVertices, int_t &curVertex, diGraph *sccGraph, int_t *sccEdgeAdded) constcymealg::diGraph< wType >inline
diGraph()cymealg::diGraph< wType >inline
Dijkstra(const roundType &rounding, int_t source, lenTable &len, weightsType &edgeWeights) constcymealg::diGraph< wType >inline
Dijkstra(const roundType &rounding, int_t source, lenTable &len) constcymealg::diGraph< wType >inline
Dijkstra(int_t source, lenTable &len) constcymealg::diGraph< wType >inline
edgeEndscymealg::diGraph< wType >protected
edgescymealg::diGraph< wType >protected
Edmonds() constcymealg::diGraph< wType >inline
EdmondsOld() constcymealg::diGraph< wType >inline
FloydWarshall(const roundType &rounding, arrayType &arr, bool setInfinity=true, bool ignoreNegLoop=false) constcymealg::diGraph< wType >inline
FloydWarshall(arrayType &arr, bool setInfinity=true, bool ignoreNegLoop=false) constcymealg::diGraph< wType >inline
getEdge(int_t vertex, int_t i) constcymealg::diGraph< wType >inline
getWeight(int_t vertex, int_t i) constcymealg::diGraph< wType >inline
getWeight(int_t edge) constcymealg::diGraph< wType >inline
Johnson(const roundType &rounding, arrayType &arr, bool setInfinity=true, bool ignoreNegLoop=false) constcymealg::diGraph< wType >inline
Johnson(arrayType &arr, bool setInfinity=true, bool ignoreNegLoop=false) constcymealg::diGraph< wType >inline
minPathWeight(const roundType &rounding, bool ignoreNegLoop=false, int sparseGraph=-1) constcymealg::diGraph< wType >
minPathWeight(bool ignoreNegLoop=false, int sparseGraph=-1) constcymealg::diGraph< wType >
nVerticescymealg::diGraph< wType >protected
operator==(const diGraph< wType1 > &g1, const diGraph< wType2 > &g2)cymealg::diGraph< wType >friend
removeVertex(void)cymealg::diGraph< wType >inline
removeVertex(int_t vertex, bool updateweights=false)cymealg::diGraph< wType >inline
setWeight(int_t vertex, int_t i, const wType &weight)cymealg::diGraph< wType >inline
setWeight(int_t edge, const wType &weight)cymealg::diGraph< wType >inline
shortestLoop(int_t origin) constcymealg::diGraph< wType >inline
shortestPath(int_t source, int_t destination) constcymealg::diGraph< wType >inline
subgraph(diGraph< wType1 > &result, const Table &tab, bool copyweights=false) constcymealg::diGraph< wType >inline
swap(diGraph< wType > &g)cymealg::diGraph< wType >inline
transpose(diGraph< wType1 > &result, bool copyweights=false) constcymealg::diGraph< wType >inline
weight_type typedefcymealg::diGraph< wType >
weightscymealg::diGraph< wType >protected
~diGraph()cymealg::diGraph< wType >inline