addEdge(int target) | chomp::homology::diGraph< wType > | [inline] |
addEdge(int target, const wType &weight) | chomp::homology::diGraph< wType > | [inline] |
addVertex(void) | chomp::homology::diGraph< wType > | [inline] |
BellmanFord(const roundType &rounding, int source, lenTable &len, wType *infinity, predTable pred) const | chomp::homology::diGraph< wType > | [inline] |
BellmanFord(int source, lenTable &len, wType *infinity, predTable pred) const | chomp::homology::diGraph< wType > | [inline] |
BellmanFord(const roundType &rounding, int source) const | chomp::homology::diGraph< wType > | [inline] |
BellmanFord(int source) const | chomp::homology::diGraph< wType > | [inline] |
countEdges(void) const | chomp::homology::diGraph< wType > | [inline] |
countEdges(int vertex) const | chomp::homology::diGraph< wType > | [inline] |
countVertices(void) const | chomp::homology::diGraph< wType > | [inline] |
DFScolor(Table &tab, const Color &color, int vertex=0) const | chomp::homology::diGraph< wType > | [inline] |
DFScolorRecurrent(Table &tab, const Color &color, int vertex=0) const | chomp::homology::diGraph< wType > | [inline] |
DFScolorStack(Table &tab, const Color &color, int vertex=0) const | chomp::homology::diGraph< wType > | [inline] |
DFSfinishTime(Table &tab) const | chomp::homology::diGraph< wType > | [inline] |
DFSfinishTimeRecurrent(Table &tab, int vertex, int &counter) const | chomp::homology::diGraph< wType > | [inline, private] |
DFSfinishTimeStack(Table &tab, int vertex, int &counter) const | chomp::homology::diGraph< wType > | [inline, private] |
DFSforest(const Table1 &ordered, Table2 &compVertices, Table3 &compEnds, bool nontrivial=false, diGraph< wType > *sccGraph=0) const | chomp::homology::diGraph< wType > | [inline] |
DFSforestRecurrent(Table1 &tab, Table1 &ntab, int vertex, int treeNumber, int countTrees, Table2 &compVertices, int &curVertex, diGraph *sccGraph, int *sccEdgeAdded) const | chomp::homology::diGraph< wType > | [inline, private] |
DFSforestStack(Table1 &tab, Table1 &ntab, int vertex, int treeNumber, int countTrees, Table2 &compVertices, int &curVertex, diGraph *sccGraph, int *sccEdgeAdded) const | chomp::homology::diGraph< wType > | [inline, private] |
diGraph() | chomp::homology::diGraph< wType > | [inline] |
Dijkstra(const roundType &rounding, int source, lenTable &len, weightsType &edgeWeights) const | chomp::homology::diGraph< wType > | [inline] |
Dijkstra(const roundType &rounding, int source, lenTable &len) const | chomp::homology::diGraph< wType > | [inline] |
Dijkstra(int source, lenTable &len) const | chomp::homology::diGraph< wType > | [inline] |
edgeEnds | chomp::homology::diGraph< wType > | [protected] |
edges | chomp::homology::diGraph< wType > | [protected] |
Edmonds() const | chomp::homology::diGraph< wType > | [inline] |
EdmondsOld() const | chomp::homology::diGraph< wType > | [inline] |
FloydWarshall(const roundType &rounding, arrayType &arr, bool setInfinity=true, bool ignoreNegLoop=false) const | chomp::homology::diGraph< wType > | [inline] |
FloydWarshall(arrayType &arr, bool setInfinity=true, bool ignoreNegLoop=false) const | chomp::homology::diGraph< wType > | [inline] |
getEdge(int vertex, int i) const | chomp::homology::diGraph< wType > | [inline] |
getWeight(int vertex, int i) const | chomp::homology::diGraph< wType > | [inline] |
getWeight(int edge) const | chomp::homology::diGraph< wType > | [inline] |
getWeights(Table &tab) const | chomp::homology::diGraph< wType > | [inline] |
Johnson(const roundType &rounding, arrayType &arr, bool setInfinity=true, bool ignoreNegLoop=false) const | chomp::homology::diGraph< wType > | [inline] |
Johnson(arrayType &arr, bool setInfinity=true, bool ignoreNegLoop=false) const | chomp::homology::diGraph< wType > | [inline] |
minMeanCycleWeight(diGraph< wType > *transposed=0) const | chomp::homology::diGraph< wType > | [inline] |
minMeanCycleWeight(const roundType &rounding, diGraph< wType > *transposed) const | chomp::homology::diGraph< wType > | [inline] |
minMeanPathWeight(const roundType &rounding, const arrayType &starting, int n) const | chomp::homology::diGraph< wType > | [inline] |
minMeanPathWeight(const arrayType &starting, int n) const | chomp::homology::diGraph< wType > | [inline] |
minPathWeight(const roundType &rounding, bool ignoreNegLoop=false, int sparseGraph=-1) const | chomp::homology::diGraph< wType > | [inline] |
minPathWeight(bool ignoreNegLoop=false, int sparseGraph=-1) const | chomp::homology::diGraph< wType > | [inline] |
nVertices | chomp::homology::diGraph< wType > | [protected] |
operator==(const diGraph< wType1 > &g1, const diGraph< wType2 > &g2) | chomp::homology::diGraph< wType > | [friend] |
removeVertex(void) | chomp::homology::diGraph< wType > | [inline] |
removeVertex(int vertex, bool updateweights=false) | chomp::homology::diGraph< wType > | [inline] |
setWeight(int vertex, int i, const wType &weight) | chomp::homology::diGraph< wType > | [inline] |
setWeight(int edge, const wType &weight) | chomp::homology::diGraph< wType > | [inline] |
setWeights(const Table &tab) | chomp::homology::diGraph< wType > | [inline] |
shortestLoop(int origin) const | chomp::homology::diGraph< wType > | [inline] |
shortestPath(int source, int destination) const | chomp::homology::diGraph< wType > | [inline] |
show(outType &out, bool showWeights=false) const | chomp::homology::diGraph< wType > | [inline] |
subgraph(diGraph< wType1 > &result, const Table &tab, bool copyweights=false) const | chomp::homology::diGraph< wType > | [inline] |
swap(diGraph< wType > &g) | chomp::homology::diGraph< wType > | [inline] |
transpose(diGraph< wType1 > &result, bool copyweights=false) const | chomp::homology::diGraph< wType > | [inline] |
weight_type typedef | chomp::homology::diGraph< wType > | |
weights | chomp::homology::diGraph< wType > | [protected] |
writeEdges(int(*table)[2]) const | chomp::homology::diGraph< wType > | [inline] |
~diGraph() | chomp::homology::diGraph< wType > | [inline] |