The CyMeAlg Software (Release 0.01)
|
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) const | cymealg::diGraph< wType > | inline |
BellmanFord(int_t source, lenTable &len, wType *infinity, predTable pred) const | cymealg::diGraph< wType > | inline |
BellmanFord(const roundType &rounding, int_t source) const | cymealg::diGraph< wType > | inline |
BellmanFord(int_t source) const | cymealg::diGraph< wType > | inline |
countEdges(void) const | cymealg::diGraph< wType > | inline |
countEdges(int_t vertex) const | cymealg::diGraph< wType > | inline |
countVertices(void) const | cymealg::diGraph< wType > | inline |
DFScolor(Table &tab, const Color &color, int_t vertex=0) const | cymealg::diGraph< wType > | inline |
DFScolorRecurrent(Table &tab, const Color &color, int_t vertex=0) const | cymealg::diGraph< wType > | inline |
DFScolorStack(Table &tab, const Color &color, int_t vertex=0) const | cymealg::diGraph< wType > | inline |
DFSfinishTime(Table &tab) const | cymealg::diGraph< wType > | inline |
DFSfinishTimeRecurrent(Table &tab, int_t vertex, int_t &counter) const | cymealg::diGraph< wType > | inline |
DFSfinishTimeStack(Table &tab, int_t vertex, int_t &counter) const | cymealg::diGraph< wType > | inline |
DFSforest(const Table1 &ordered, Table2 &compVertices, Table3 &compEnds, bool nontrivial=false, diGraph< wType > *sccGraph=0) const | cymealg::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) const | cymealg::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) const | cymealg::diGraph< wType > | inline |
diGraph() | cymealg::diGraph< wType > | inline |
Dijkstra(const roundType &rounding, int_t source, lenTable &len, weightsType &edgeWeights) const | cymealg::diGraph< wType > | inline |
Dijkstra(const roundType &rounding, int_t source, lenTable &len) const | cymealg::diGraph< wType > | inline |
Dijkstra(int_t source, lenTable &len) const | cymealg::diGraph< wType > | inline |
edgeEnds | cymealg::diGraph< wType > | protected |
edges | cymealg::diGraph< wType > | protected |
Edmonds() const | cymealg::diGraph< wType > | inline |
EdmondsOld() const | cymealg::diGraph< wType > | inline |
FloydWarshall(const roundType &rounding, arrayType &arr, bool setInfinity=true, bool ignoreNegLoop=false) const | cymealg::diGraph< wType > | inline |
FloydWarshall(arrayType &arr, bool setInfinity=true, bool ignoreNegLoop=false) const | cymealg::diGraph< wType > | inline |
getEdge(int_t vertex, int_t i) const | cymealg::diGraph< wType > | inline |
getWeight(int_t vertex, int_t i) const | cymealg::diGraph< wType > | inline |
getWeight(int_t edge) const | cymealg::diGraph< wType > | inline |
Johnson(const roundType &rounding, arrayType &arr, bool setInfinity=true, bool ignoreNegLoop=false) const | cymealg::diGraph< wType > | inline |
Johnson(arrayType &arr, bool setInfinity=true, bool ignoreNegLoop=false) const | cymealg::diGraph< wType > | inline |
minPathWeight(const roundType &rounding, bool ignoreNegLoop=false, int sparseGraph=-1) const | cymealg::diGraph< wType > | |
minPathWeight(bool ignoreNegLoop=false, int sparseGraph=-1) const | cymealg::diGraph< wType > | |
nVertices | cymealg::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) const | cymealg::diGraph< wType > | inline |
shortestPath(int_t source, int_t destination) const | cymealg::diGraph< wType > | inline |
subgraph(diGraph< wType1 > &result, const Table &tab, bool copyweights=false) const | cymealg::diGraph< wType > | inline |
swap(diGraph< wType > &g) | cymealg::diGraph< wType > | inline |
transpose(diGraph< wType1 > &result, bool copyweights=false) const | cymealg::diGraph< wType > | inline |
weight_type typedef | cymealg::diGraph< wType > | |
weights | cymealg::diGraph< wType > | protected |
~diGraph() | cymealg::diGraph< wType > | inline |