, including all inherited members.
| adjMatrix | Graph | [protected] |
| calcEdgeIndex(list< set< unsigned > > &) | Graph | |
| connComp() | Graph | |
| deleteDoubleArray(int **, int) | Graph | |
| edgeNumber(int a, int b) | Graph | |
| edges | Graph | [protected] |
| edgeToNode(unsigned someEdge, unsigned &, unsigned &) | Graph | |
| edgeToNodeEdgeIndex(unsigned someEdge, unsigned &, unsigned &, Matrix &edgeIndex) | Graph | [static] |
| findChildren(Graph &G, set< unsigned > &initTree, set< unsigned > &deltaf, set< unsigned > &deltag, set< unsigned > deltaH, Matrix &edgeIndex, unsigned printMod, unsigned printTrees) | Graph | [friend] |
| findChildren(Graph &G, set< unsigned > &initTree, set< unsigned > &deltaf, set< unsigned > &deltag, set< unsigned > deltaH, Matrix &edgeIndex, Matrix &Weight, set< Matrix, ltcolvec > &projTrees, unsigned printMod, unsigned printTrees) | Graph | [friend] |
| findChildrenBFSLevel | Graph | |
| findChildrenSpanningTreeCount | Graph | |
| FloydWarshall() | Graph | |
| getEdgeIndex(unsigned someEdge, Matrix &edgeIndex) | Graph | |
| getNumConnComponents() | Graph | |
| getNumEdges() | Graph | |
| Graph() | Graph | |
| Graph(const Graph &G) | Graph | |
| Graph(Matrix &M) | Graph | |
| Graph(std::istream &in) | Graph | |
| initGraph() | Graph | [protected] |
| isCycleFree(set< unsigned > someEdges) | Graph | |
| isSpanningForest(list< vector< unsigned > > someEdges) | Graph | |
| isSpanningForest(set< unsigned > someEdges) | Graph | |
| leftLessThanEqualRight(double a, double b, double c) | Graph | |
| listEdgesToSet(list< vector< unsigned > > &) | Graph | |
| MatsuiBottom(Matrix &edgeIndex) | Graph | |
| MatsuiBottom(Matrix &edgeIndex, set< unsigned > &someEdges) | Graph | |
| MatsuiTop(Matrix &edgeIndex) | Graph | |
| MatsuiTop(Matrix &edgeIndex, set< unsigned > &someEdges) | Graph | |
| NagIbar() | Graph | |
| nodesConnected(int, int) | Graph | |
| nodesToEdgeNumber | Graph | [protected] |
| numConnComponents | Graph | [protected] |
| numEdges | Graph | [protected] |
| numNodes | Graph | [protected] |
| operator<<(std::ostream &o, const Graph &G) | Graph | [friend] |
| operator=(const Graph &G) | Graph | |
| operator>>(std::istream &in, Graph &G) | Graph | [friend] |
| predMatrix | Graph | [protected] |
| predMatrixComputed | Graph | [protected] |
| printVertexEdgeMatrix() | Graph | |
| randSpanningForest() | Graph | |
| randSpanningForest(int &cycleFree) | Graph | |
| rank() | Graph | |
| readGraph(std::istream &in) | Graph | |
| shortestPath(unsigned n1, unsigned n2) | Graph | |
| shortestPathList(unsigned n1, unsigned n2) | Graph | |
| subGraph(set< unsigned > &someEdges) | Graph | |
| subGraph(list< vector< unsigned > > &someEdges) | Graph | |
| subGraphDiff(set< unsigned > &someEdges) | Graph | |
| subGraphDiff(list< vector< unsigned > > &someEdges) | Graph | |
| transClosure | Graph | [protected] |
| transClosureComputed | Graph | [protected] |
| ~Graph() | Graph | |
1.7.6.1
