| addNode(NODETYPE _node) | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| addUndirectedEdge(unsigned int _nodeIdx1, unsigned int _nodeIdx2) | geGraph::UndirectedGraph< NODETYPE, EDGETYPE, U > | inline |
| addWeightedUndirectedEdge(unsigned int _nodeIdx1, unsigned int _nodeIdx2, float _weight) | geGraph::UndirectedGraph< NODETYPE, EDGETYPE, U > | inline |
| backwardEdges | geGraph::Graph< NODETYPE, EDGETYPE, U > | protected |
| clearProperties() | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| crossings | geGraph::Graph< NODETYPE, EDGETYPE, U > | protected |
| edges | geGraph::Graph< NODETYPE, EDGETYPE, U > | protected |
| endPoints | geGraph::Graph< NODETYPE, EDGETYPE, U > | protected |
| forwardEdges | geGraph::Graph< NODETYPE, EDGETYPE, U > | protected |
| getCrossingID(unsigned int _idx) | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| getCrossingIDs() | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| getEdge(unsigned int _idx) | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| getEdgeByNodeIDs(unsigned int _nodeIdx1, unsigned int _nodeIdx2) | geGraph::UndirectedGraph< NODETYPE, EDGETYPE, U > | inline |
| getEdgeCount() | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| getEdgesForReducedEdge(unsigned int _redEdgeID) | geGraph::ReducableUndirectedGraph< NODETYPE, EDGETYPE, U > | inline |
| getEndnodeIDs() | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| getEndPointID(unsigned int _idx) | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| getGraphNodes() | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| getMapToIterate() const | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| getNode(unsigned int _idx) | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| getNodeContentByID(U _id) const | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| getNodeCount() const | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| getNodeIDByContent(const NODETYPE _content) const | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| getNumberOfCrossings() const | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| getNumberOfEndpoints() const | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| getReducedEdge(unsigned int _redEdgeID) | geGraph::ReducableUndirectedGraph< NODETYPE, EDGETYPE, U > | inline |
| getReducedEdgesCount() | geGraph::ReducableUndirectedGraph< NODETYPE, EDGETYPE, U > | inline |
| getReducedEdgesForNodeID(unsigned int _nodeID) | geGraph::ReducableUndirectedGraph< NODETYPE, EDGETYPE, U > | inline |
| getReducedNodeIDsForReducedEdge(unsigned int _redEdgeID) | geGraph::ReducableUndirectedGraph< NODETYPE, EDGETYPE, U > | inline |
| getReducedNodesForNodeID(unsigned int _startNodeID, unsigned int _endNodeID) | geGraph::ReducableUndirectedGraph< NODETYPE, EDGETYPE, U > | inline |
| Graph() | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| nodeByContent | geGraph::Graph< NODETYPE, EDGETYPE, U > | protected |
| nodeByID | geGraph::Graph< NODETYPE, EDGETYPE, U > | protected |
| nodes | geGraph::Graph< NODETYPE, EDGETYPE, U > | protected |
| numberOfAbandonedNodes | geGraph::Graph< NODETYPE, EDGETYPE, U > | protected |
| numberOfConnectors | geGraph::Graph< NODETYPE, EDGETYPE, U > | protected |
| ReducableUndirectedGraph() | geGraph::ReducableUndirectedGraph< NODETYPE, EDGETYPE, U > | inline |
| reduceEdges() | geGraph::ReducableUndirectedGraph< NODETYPE, EDGETYPE, U > | inline |
| reduceFromCrossing(unsigned int _nodeID) | geGraph::ReducableUndirectedGraph< NODETYPE, EDGETYPE, U > | inline |
| reduceFromEndpoint(unsigned int _nodeID) | geGraph::ReducableUndirectedGraph< NODETYPE, EDGETYPE, U > | inline |
| UndirectedGraph() | geGraph::UndirectedGraph< NODETYPE, EDGETYPE, U > | inline |
| updateGraphProperties() | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
| ~Graph() | geGraph::Graph< NODETYPE, EDGETYPE, U > | inline |
1.8.9 
