GlobeEngine
|
#include <ReducableUndirectedGraph.h>
Public Member Functions | |
ReducableUndirectedGraph () | |
void | reduceEdges () |
void | reduceFromEndpoint (unsigned int _nodeID) |
void | reduceFromCrossing (unsigned int _nodeID) |
std::vector< U > | getEdgesForReducedEdge (unsigned int _redEdgeID) |
std::vector< U > | getReducedEdgesForNodeID (unsigned int _nodeID) |
std::vector< U > | getReducedNodesForNodeID (unsigned int _startNodeID, unsigned int _endNodeID) |
std::vector< U > | getReducedNodeIDsForReducedEdge (unsigned int _redEdgeID) |
EDGETYPE * | getReducedEdge (unsigned int _redEdgeID) |
unsigned int | getReducedEdgesCount () |
Public Member Functions inherited from geGraph::UndirectedGraph< NODETYPE, EDGETYPE, U > | |
UndirectedGraph () | |
unsigned int | addUndirectedEdge (unsigned int _nodeIdx1, unsigned int _nodeIdx2) |
unsigned int | addWeightedUndirectedEdge (unsigned int _nodeIdx1, unsigned int _nodeIdx2, float _weight) |
U | getEdgeByNodeIDs (unsigned int _nodeIdx1, unsigned int _nodeIdx2) |
Public Member Functions inherited from geGraph::Graph< NODETYPE, EDGETYPE, U > | |
Graph () | |
~Graph () | |
void | clearProperties () |
unsigned int | addNode (NODETYPE _node) |
const std::map< U, NODETYPE > | getMapToIterate () const |
U | getNodeCount () const |
U | getNodeIDByContent (const NODETYPE _content) const |
NODETYPE | getNodeContentByID (U _id) const |
std::vector< GraphNode< U > > | getGraphNodes () |
std::vector< U > | getEndnodeIDs () |
std::vector< U > | getCrossingIDs () |
void | updateGraphProperties () |
unsigned int | getNumberOfEndpoints () const |
unsigned int | getNumberOfCrossings () const |
U | getEndPointID (unsigned int _idx) |
U | getCrossingID (unsigned int _idx) |
U | getEdgeCount () |
EDGETYPE * | getEdge (unsigned int _idx) |
GraphNode< U > | getNode (unsigned int _idx) |
Additional Inherited Members | |
Protected Attributes inherited from geGraph::Graph< NODETYPE, EDGETYPE, U > | |
std::map< NODETYPE, U > | nodeByContent |
std::map< U, NODETYPE > | nodeByID |
std::vector< GraphNode< U > > | nodes |
std::vector< EDGETYPE > | edges |
std::map< std::pair< U, U >, U > | forwardEdges |
std::map< std::pair< U, U >, U > | backwardEdges |
std::vector< U > | endPoints |
std::vector< U > | crossings |
unsigned int | numberOfConnectors |
unsigned int | numberOfAbandonedNodes |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |