A generic Graph class. More...
#include <Graph.h>
Public Member Functions | |
| Graph () | |
| ~Graph () | |
| graph_object * | Clone () const |
| Graph * | cloneAll () const |
| void | Reset () |
| void | Save (const char *file) |
| void | Load (const char *file) |
| void | Export (const char *fname) |
| int | AddNode (node *) |
| node * | GetNode (unsigned long num) |
| const node * | GetNode (unsigned long num) const |
| edge * | GetEdge (unsigned long num) |
| void | AddEdge (edge *) |
| edge * | findDirectedEdge (unsigned int from, unsigned int to) |
| edge * | FindEdge (unsigned int from, unsigned int to) |
| Finds an edge between nodes with ids from and to, no matter which direction. More... | |
| const edge * | FindEdge (unsigned int from, unsigned int to) const |
| bool | relax (edge *e, int weightIndex) |
| bool | relaxReverseEdge (edge *e, int weightIndex) |
| node * | GetRandomNode () |
| edge * | GetRandomEdge () |
| node_iterator | getNodeIter () const |
| node * | nodeIterNext (node_iterator &) const |
| edge_iterator | getEdgeIter () const |
| edge * | edgeIterNext (edge_iterator &) const |
| void | RemoveEdge (edge *) |
| node * | RemoveNode (node *, unsigned int &) |
| void | RemoveNode (node *n) |
| void | RemoveNode (unsigned int nodeNum) |
| int | GetNumEdges () |
| int | GetNumNodes () |
| std::vector< node * > * | getReachableNodes (node *start) |
| bool | verifyGraph () const |
| void | Print (std::ostream &) const |
| void | printStats () |
 Public Member Functions inherited from graph_object | |
| graph_object () | |
| virtual | ~graph_object () |
| virtual double | GetKey () |
Private Attributes | |
| std::vector< node * > | _nodes |
| std::vector< edge * > | _edges |
Additional Inherited Members | |
| Public Attributes inherited from graph_object | |
| unsigned int | key |
Detailed Description
Constructor & Destructor Documentation
◆ Graph()
| Graph::Graph | ( | ) |
Definition at line 33 of file Graph.cpp.
Referenced by Clone(), and cloneAll().
◆ ~Graph()
Member Function Documentation
◆ AddEdge()
| void Graph::AddEdge | ( | edge * | e | ) |
Definition at line 170 of file Graph.cpp.
References _edges, _nodes, edge::edgeNum, edge::getFrom(), and edge::getTo().
Referenced by LoadedBBAbstraction::abstractGraph(), MapCliqueAbstraction::abstractUpEdge(), LoadedCliqueAbstraction::abstractUpEdge(), ClusterAbstraction::addAbsNodes(), RadiusAbstraction::addEdges(), MapLineAbstraction::addEdges(), MapSectorAbstraction::addEdges(), NodeLimitAbstraction::addEdges(), GraphSearchConstants::AddEdges(), AddMapEdges(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), cloneAll(), ClusterAbstraction::computeClusterPaths(), TopSpinGraph::ExpandNode(), MeroBUtil::graphGenerator::genFig1(), PropUtil::graphGenerator::genFig1(), MeroBUtil::graphGenerator::genFig2(), PropUtil::graphGenerator::genFig2(), PropUtil::graphGenerator::genFig3(), PropUtil::graphGenerator::genFig4(), GraphInconsistencyExamples::GetExpoGraph(), MNPuzzle< width, height >::GetGraph(), GraphInconsistencyExamples::GetPolyGraph(), GraphInconsistencyExamples::GetWeightedInconsistency(), ClusterAbstraction::insertNode(), LoadedCliqueAbstraction::loadGraph(), LoadedBBAbstraction::loadGraph(), LoadedCliqueAbstraction::neighborAbstractGraph(), IRDijkstra::RefineNode(), IRAStar::RefineNode(), CFOptimalRefinement::RefineNode(), and RoadMap::RoadMap().
◆ AddNode()
| int Graph::AddNode | ( | node * | n | ) |
Definition at line 136 of file Graph.cpp.
References _nodes, and node::nodeNum.
Referenced by ClusterAbstraction::addAbsNodes(), RadiusAbstraction::addNodes(), MapSectorAbstraction::addNodes(), NodeLimitAbstraction::addNodes(), GraphSearchConstants::AddNodesToGraph(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), Clone(), cloneAll(), ClusterAbstraction::createConnectivityGraph(), LoadedBBAbstraction::createNewParent(), MapLineAbstraction::createParent(), MapCliqueAbstraction::extractGroupIntoNewNode(), LoadedCliqueAbstraction::extractGroupIntoNewNode(), MeroBUtil::graphGenerator::genFig1(), PropUtil::graphGenerator::genFig1(), MeroBUtil::graphGenerator::genFig2(), PropUtil::graphGenerator::genFig2(), PropUtil::graphGenerator::genFig3(), PropUtil::graphGenerator::genFig4(), GraphInconsistencyExamples::GetExpoGraph(), MNPuzzle< width, height >::GetGraph(), GetMapGraph(), GraphInconsistencyExamples::GetPolyGraph(), TopSpinGraph::GetState(), GraphInconsistencyExamples::GetWeightedInconsistency(), IRDijkstra::InitializeSearch(), IRAStar::InitializeSearch(), CFOptimalRefinement::InitializeSearch(), ClusterAbstraction::insertNode(), LoadedCliqueAbstraction::loadGraph(), LoadedBBAbstraction::loadGraph(), LoadedCliqueAbstraction::neighborAbstractGraph(), IRDijkstra::RefineNode(), IRAStar::RefineNode(), CFOptimalRefinement::RefineNode(), RoadMap::RoadMap(), and ClusterAbstraction::setUpParents().
◆ Clone()
|
virtual |
Implements graph_object.
Definition at line 77 of file Graph.cpp.
References AddNode(), node::Clone(), getNodeIter(), Graph(), and nodeIterNext().
◆ cloneAll()
| Graph * Graph::cloneAll | ( | ) | const |
Definition at line 92 of file Graph.cpp.
References AddEdge(), AddNode(), edge::Clone(), node::Clone(), edgeIterNext(), getEdgeIter(), getNodeIter(), Graph(), and nodeIterNext().
◆ edgeIterNext()
| edge * Graph::edgeIterNext | ( | edge_iterator & | edge_iter | ) | const |
Definition at line 320 of file Graph.cpp.
References _edges.
Referenced by LoadedBBAbstraction::abstractGraph(), MapLineAbstraction::addEdges(), RadiusAbstraction::addEdges(), MapSectorAbstraction::addEdges(), NodeLimitAbstraction::addEdges(), GraphAbstraction::ClearMarkedNodes(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), cloneAll(), CanonicalGraphEnvironment::ComputeOrdering(), GraphEnvironment::Draw(), LoadedBBAbstraction::DrawGraph(), LoadedCliqueAbstraction::DrawGraph(), GraphEnvironment::DrawLERP(), Export(), LoadedCliqueAbstraction::neighborAbstractGraph(), CanonicalGraphEnvironment::OpenGLDraw(), IRDijkstra::OpenGLDraw(), IRAStar::OpenGLDraw(), CFOptimalRefinement::OpenGLDraw(), GraphEnvironment::OpenGLDraw(), Print(), Reset(), GraphEnvironment::SVGDraw(), verifyGraph(), and ClusterAbstraction::~ClusterAbstraction().
◆ Export()
| void Graph::Export | ( | const char * | fname | ) |
Definition at line 116 of file Graph.cpp.
References edgeIterNext(), getEdgeIter(), edge::getFrom(), GetNumEdges(), GetNumNodes(), edge::getTo(), and edge::GetWeight().
◆ findDirectedEdge()
| edge * Graph::findDirectedEdge | ( | unsigned int | from, |
| unsigned int | to | ||
| ) |
Definition at line 189 of file Graph.cpp.
References node::edgeIterNextOutgoing(), GetNode(), node::getOutgoingEdgeIter(), and edge::getTo().
Referenced by CanonicalGraphEnvironment::InvertAction(), GraphEnvironment::InvertAction(), IRDijkstra::RefineNode(), IRAStar::RefineNode(), CFOptimalRefinement::RefineNode(), and RoadMap::RoadMap().
◆ FindEdge() [1/2]
| edge * Graph::FindEdge | ( | unsigned int | from, |
| unsigned int | to | ||
| ) |
Finds an edge between nodes with ids from and to, no matter which direction.
- Returns
- the edge found or null if no edge is found
Definition at line 230 of file Graph.cpp.
References node::_allEdges, node::edgeIterNext(), node::getEdgeIter(), edge::getFrom(), GetNode(), and edge::getTo().
Referenced by LoadedBBAbstraction::abstractGraph(), MapCliqueAbstraction::abstractUpEdge(), LoadedCliqueAbstraction::abstractUpEdge(), RadiusAbstraction::addEdges(), MapLineAbstraction::addEdges(), MapSectorAbstraction::addEdges(), NodeLimitAbstraction::addEdges(), MapLineAbstraction::addNodes(), MapCliqueAbstraction::checkNeighborClique(), LoadedCliqueAbstraction::checkNeighborClique(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), GraphDistanceHeuristic::ComputeSizes(), ClusterAbstraction::createHorizEntrances(), ClusterAbstraction::createVertEntrances(), craStar::doRefinement(), IRAStar::ExpandNeighbors(), TopSpinGraph::ExpandNode(), aStar::extractPathToStart(), GraphMapInconsistentHeuristic::FillInCache(), GraphDistanceHeuristic::FindBestChild(), MapCliqueAbstraction::findEdgeParent(), LoadedCliqueAbstraction::findEdgeParent(), GraphDistanceHeuristic::FindFarNode(), hpaStar::findMapPath(), CanonicalGraphEnvironment::GCost(), GraphEnvironment::GCost(), corridorAStar::getBestPath(), MNPuzzle< width, height >::GetGraph(), craStar::getNextNode(), GraphDistanceHeuristic::GetOptimalDistances(), praStar::GetPath(), spreadPRAStar::GetPath(), praStar2::GetPath(), craStar::GetPath(), IRAStar::GetSolution(), AbstractionSearchEnvironment::heuristic(), OldSearchCode::GraphSearchEnvironment::heuristic(), IRAStar::Inconsistent(), LoadedCliqueAbstraction::neighborAbstractGraph(), hpaStar::nextPathNode(), craStar::nextPathNode(), WeightedMap2DEnvironment::OpenGLDraw(), IRDijkstra::RefineNode(), IRAStar::RefineNode(), CFOptimalRefinement::RefineNode(), CFOptimalRefinement::UpdateG(), CFOptimalRefinement::UpdateH(), SharedAMapGroup::UpdateLocation(), and CFOptimalRefinement::UpdateOptH().
◆ FindEdge() [2/2]
| const edge * Graph::FindEdge | ( | unsigned int | from, |
| unsigned int | to | ||
| ) | const |
Definition at line 204 of file Graph.cpp.
References node::_allEdges, node::edgeIterNext(), node::getEdgeIter(), edge::getFrom(), GetNode(), and edge::getTo().
◆ GetEdge()
| edge * Graph::GetEdge | ( | unsigned long | num | ) |
Definition at line 164 of file Graph.cpp.
References _edges.
Referenced by FloydWarshall(), and Prim().
◆ getEdgeIter()
| edge_iterator Graph::getEdgeIter | ( | ) | const |
Definition at line 315 of file Graph.cpp.
References _edges.
Referenced by LoadedBBAbstraction::abstractGraph(), MapLineAbstraction::addEdges(), RadiusAbstraction::addEdges(), MapSectorAbstraction::addEdges(), NodeLimitAbstraction::addEdges(), spreadPRAStar::buildNextAbstractPath(), praStar2::buildNextAbstractPath(), craStar::buildNextAbstractPath(), GraphAbstraction::ClearMarkedNodes(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), cloneAll(), CanonicalGraphEnvironment::ComputeOrdering(), GraphEnvironment::Draw(), LoadedBBAbstraction::DrawGraph(), LoadedCliqueAbstraction::DrawGraph(), GraphEnvironment::DrawLERP(), Export(), LoadedCliqueAbstraction::neighborAbstractGraph(), CanonicalGraphEnvironment::OpenGLDraw(), IRDijkstra::OpenGLDraw(), IRAStar::OpenGLDraw(), CFOptimalRefinement::OpenGLDraw(), GraphEnvironment::OpenGLDraw(), Print(), Reset(), GraphEnvironment::SVGDraw(), verifyGraph(), and ClusterAbstraction::~ClusterAbstraction().
◆ GetNode() [1/2]
| node * Graph::GetNode | ( | unsigned long | num | ) |
Definition at line 152 of file Graph.cpp.
References _nodes.
Referenced by LoadedBBAbstraction::abstractGraph(), NodeLimitAbstraction::abstractionBFS(), MapCliqueAbstraction::abstractUpEdge(), LoadedCliqueAbstraction::abstractUpEdge(), MapLineAbstraction::addEdges(), RadiusAbstraction::addEdges(), MapSectorAbstraction::addEdges(), NodeLimitAbstraction::addEdges(), LoadedBBAbstraction::addNeighborsInBox(), aStar::addNeighborsToCorridor(), MapLineAbstraction::addNodes(), MapCliqueAbstraction::addNodesToParent(), LoadedCliqueAbstraction::addNodesToParent(), MapCliqueAbstraction::addTunnel(), LoadedCliqueAbstraction::addTunnel(), praStar::astar(), MapFlatAbstraction::buildConnectivityGroups(), spreadPRAStar::buildNextAbstractPath(), praStar2::buildNextAbstractPath(), craStar::buildNextAbstractPath(), MapCliqueAbstraction::checkNeighborClique(), LoadedCliqueAbstraction::checkNeighborClique(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), ClusterAbstraction::computeClusterPaths(), CanonicalGraphEnvironment::ComputeOrdering(), GraphDistanceHeuristic::ComputeSizes(), GraphOccupancyInterface::Convert(), GraphAbstraction::CountEdgesAtDistance(), craStar::doRefinement(), GraphEnvironment::Draw(), WeightedMap2DEnvironment::DrawEdge(), MeroB::DrawEdge(), LoadedBBAbstraction::DrawGraph(), LoadedCliqueAbstraction::DrawGraph(), GraphEnvironment::DrawLERP(), GraphEnvironment::DrawLine(), GraphEnvironment::DrawStateLabel(), IRDijkstra::ExpandNeighbors(), IRAStar::ExpandNeighbors(), aStarOld::extractBestPath(), corridorAStar::extractBestPath(), FringeSearch::extractBestPath(), GraphMapInconsistentHeuristic::FillInCache(), GraphDistanceHeuristic::FindAvoidNode(), GraphDistanceHeuristic::FindBestChild(), findDirectedEdge(), FindEdge(), MapCliqueAbstraction::findEdgeParent(), LoadedCliqueAbstraction::findEdgeParent(), GraphDistanceHeuristic::FindFarNode(), craStar::findGoalNode(), MapCliqueAbstraction::findNeighborCliques(), LoadedCliqueAbstraction::findNeighborCliques(), AbsGraphEnvironment::GCost(), praStar::getAbstractPath(), CanonicalGraphEnvironment::GetActionHash(), GraphEnvironment::GetActionHash(), GraphEnvironment::GetActions(), IRDijkstra::GetAllSolutionNodes(), IRAStar::GetAllSolutionNodes(), corridorAStar::getBestPath(), MapCliqueAbstraction::getChildGroups(), LoadedCliqueAbstraction::getChildGroups(), GraphInconsistencyExamples::GetExpoGraph(), MNPuzzle< width, height >::GetGraph(), MapCliqueAbstraction::getGroupSize(), LoadedCliqueAbstraction::getGroupSize(), GraphEnvironment::GetLocation(), AbstractionSearchEnvironment::getNeighbors(), OldSearchCode::GraphSearchEnvironment::getNeighbors(), OldSearchCode::MapGraphSearchEnvironment::getNeighbors(), craStar::getNextNode(), MapCliqueAbstraction::getNodeInGroup(), LoadedCliqueAbstraction::getNodeInGroup(), GraphAbstraction::GetNthParent(), GraphAbstraction::GetNumExternalEdges(), GraphEnvironment::GetNumSuccessors(), GraphDistanceHeuristic::GetOptimalDistances(), aStarOld::GetPath(), FringeSearch::GetPath(), AbstractWeightedSearchAlgorithm< state, action, environment >::GetPath(), IRDijkstra::GetRealNode(), IRAStar::GetRealNode(), CFOptimalRefinement::GetRealNode(), IRDijkstra::GetSolution(), IRAStar::GetSolution(), CanonicalGraphEnvironment::GetStateHash(), GraphEnvironment::GetStateHash(), GraphRefinementEnvironment::GetSuccessors(), CanonicalGraphEnvironment::GetSuccessors(), GraphEnvironment::GetSuccessors(), CanonicalGraphEnvironment::GLDrawLine(), GraphEnvironment::GLDrawLine(), GraphEnvironment::GLLabelState(), GraphRefinementEnvironment::GoalTest(), AbsGraphEnvironment::GoalTest(), GraphInconsistencyExamples::GraphHeuristic::HCost(), RoadMap::HCost(), GraphRefinementEnvironment::HCost(), GraphLabelHeuristic::HCost(), GraphMapHeuristic::HCost(), AbsGraphEnvironment::HCost(), GraphMapPerfectHeuristic::HCost(), GraphStraightLineHeuristic::HCost(), GraphMapInconsistentHeuristic::HCost(), OctileHeuristic::HCost(), AbstractionSearchEnvironment::heuristic(), OldSearchCode::MapGraphSearchEnvironment::heuristic(), IRAStar::Inconsistent(), ClusterAbstraction::insertNode(), MapCliqueAbstraction::insertNodeIntoHierarchy(), LoadedCliqueAbstraction::insertNodeIntoHierarchy(), LoadedCliqueAbstraction::loadGraph(), LoadedBBAbstraction::loadGraph(), SearchUnit::makeMove(), CFOptimalRefinement::MakeNeighborsOpen(), MapCliqueAbstraction::mergeGroupIntoNeighbor(), LoadedCliqueAbstraction::mergeGroupIntoNeighbor(), LoadedCliqueAbstraction::neighborAbstractGraph(), ClusterAbstraction::nodeExists(), CanonicalGraphEnvironment::OpenGLDraw(), IRDijkstra::OpenGLDraw(), IRAStar::OpenGLDraw(), CFOptimalRefinement::OpenGLDraw(), GraphDistanceHeuristic::OpenGLDraw(), GraphMapInconsistentHeuristic::OpenGLDraw(), GraphEnvironment::OpenGLDraw(), Prim(), AbsGraphEnvironment::Print(), ClusterAbstraction::printMapCoord(), FringeSearch::propagateGValues(), FringeSearch::propagateHValues(), IRDijkstra::RefineNode(), IRAStar::RefineNode(), CFOptimalRefinement::RefineNode(), relax(), aStarOld::relaxEdge(), praStar::relaxEdge(), relaxReverseEdge(), RemoveEdge(), RemoveNode(), MapCliqueAbstraction::resetLocationCache(), RoadMap::RoadMap(), ClusterAbstraction::setUpParents(), IRDijkstra::ShouldAddEdge(), IRAStar::ShouldAddEdge(), CFOptimalRefinement::ShouldAddEdge(), GraphEnvironment::SVGDraw(), GraphEnvironment::SVGLabelState(), MapCliqueAbstraction::transferGroup(), LoadedCliqueAbstraction::transferGroup(), CFOptimalRefinement::UpdateG(), CFOptimalRefinement::UpdateH(), CFOptimalRefinement::UpdateOptH(), LoadedBBAbstraction::VerifyHierarchy(), MapCliqueAbstraction::VerifyHierarchy(), LoadedCliqueAbstraction::VerifyHierarchy(), and GraphAbstraction::WidthBFS().
◆ GetNode() [2/2]
| const node * Graph::GetNode | ( | unsigned long | num | ) | const |
◆ getNodeIter()
| node_iterator Graph::getNodeIter | ( | ) | const |
Definition at line 298 of file Graph.cpp.
References _nodes.
Referenced by LoadedBBAbstraction::abstractGraph(), MapFlatAbstraction::buildConnectivityGroups(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), Clone(), cloneAll(), WeightedMap2DEnvironment::ComputeArrowMetric(), ClusterAbstraction::createConnectivityGraph(), LoadedBBAbstraction::DrawGraph(), LoadedCliqueAbstraction::DrawGraph(), GetMapGraph(), GraphAbstraction::MeasureAbstractionValues(), GraphAbstraction::MeasureAverageNodeWidth(), LoadedCliqueAbstraction::neighborAbstractGraph(), WeightedMap2DEnvironment::OpenGLDraw(), Print(), printStats(), Reset(), and verifyGraph().
◆ GetNumEdges()
| int Graph::GetNumEdges | ( | ) |
Definition at line 397 of file Graph.cpp.
References _edges.
Referenced by LoadedBBAbstraction::buildAbstractions(), MapCliqueAbstraction::buildAbstractions(), LoadedCliqueAbstraction::buildAbstractions(), CanonicalGraphEnvironment::ComputeOrdering(), Export(), FloydWarshall(), Prim(), and printStats().
◆ GetNumNodes()
| int Graph::GetNumNodes | ( | ) |
Definition at line 403 of file Graph.cpp.
References _nodes.
Referenced by LoadedBBAbstraction::buildAbstractions(), MapCliqueAbstraction::buildAbstractions(), LoadedCliqueAbstraction::buildAbstractions(), MapFlatAbstraction::buildConnectivityGroups(), CanonicalGraphEnvironment::ComputeOrdering(), GraphEnvironment::Draw(), LoadedBBAbstraction::DrawGraph(), LoadedCliqueAbstraction::DrawGraph(), GraphEnvironment::DrawLERP(), GraphEnvironment::DrawLine(), GraphEnvironment::DrawStateLabel(), Export(), GraphDistanceHeuristic::FindFarNode(), FloydWarshall(), RoadMap::GetMaxHash(), CanonicalGraphEnvironment::GetMaxHash(), GraphEnvironment::GetMaxHash(), GraphDistanceHeuristic::GetOptimalDistances(), praStar::GetPath(), GraphEnvironment::GLLabelState(), CanonicalGraphEnvironment::OpenGLDraw(), IRDijkstra::OpenGLDraw(), IRAStar::OpenGLDraw(), CFOptimalRefinement::OpenGLDraw(), GraphDistanceHeuristic::OpenGLDraw(), GraphEnvironment::OpenGLDraw(), Prim(), printStats(), ClusterAbstraction::removeNodes(), praStar2::selectTopAbstractionLevel(), ClusterAbstraction::setUpParents(), spreadPRAStar::setupSearch(), and craStar::setupSearch().
◆ GetRandomEdge()
◆ GetRandomNode()
| node * Graph::GetRandomNode | ( | ) |
Definition at line 281 of file Graph.cpp.
References _nodes.
Referenced by GraphDistanceHeuristic::AddHeuristic(), DoRandomPath(), GraphDistanceHeuristic::FindAvoidNode(), generatePaths(), MyPathfindingKeyHandler(), and MyRandomUnitKeyHandler().
◆ getReachableNodes()
Definition at line 409 of file Graph.cpp.
References _nodes, node::getNeighborIter(), node::GetNum(), and node::nodeNeighborNext().
◆ Load()
| void Graph::Load | ( | const char * | file | ) |
◆ nodeIterNext()
| node * Graph::nodeIterNext | ( | node_iterator & | node_iter | ) | const |
Definition at line 303 of file Graph.cpp.
References _nodes.
Referenced by LoadedBBAbstraction::abstractGraph(), MapFlatAbstraction::buildConnectivityGroups(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), Clone(), cloneAll(), WeightedMap2DEnvironment::ComputeArrowMetric(), LoadedBBAbstraction::DrawGraph(), LoadedCliqueAbstraction::DrawGraph(), GetMapGraph(), GraphAbstraction::MeasureAbstractionValues(), GraphAbstraction::MeasureAverageNodeWidth(), LoadedCliqueAbstraction::neighborAbstractGraph(), WeightedMap2DEnvironment::OpenGLDraw(), Print(), printStats(), Reset(), and verifyGraph().
◆ Print()
|
virtual |
Reimplemented from graph_object.
Definition at line 446 of file Graph.cpp.
References edgeIterNext(), getEdgeIter(), getNodeIter(), and nodeIterNext().
Referenced by operator<<().
◆ printStats()
| void Graph::printStats | ( | ) |
Definition at line 467 of file Graph.cpp.
References getNodeIter(), GetNumEdges(), node::GetNumEdges(), GetNumNodes(), min(), and nodeIterNext().
Referenced by LoadedBBAbstraction::buildAbstractions(), MapCliqueAbstraction::buildAbstractions(), and LoadedCliqueAbstraction::buildAbstractions().
◆ relax()
| bool Graph::relax | ( | edge * | e, |
| int | weightIndex | ||
| ) |
Definition at line 251 of file Graph.cpp.
References edge::getFrom(), node::GetLabelF(), GetNode(), edge::getTo(), edge::GetWeight(), and node::SetLabelF().
◆ relaxReverseEdge()
| bool Graph::relaxReverseEdge | ( | edge * | e, |
| int | weightIndex | ||
| ) |
Definition at line 267 of file Graph.cpp.
References edge::getFrom(), node::GetLabelF(), GetNode(), edge::getTo(), edge::GetWeight(), and node::SetLabelF().
◆ RemoveEdge()
| void Graph::RemoveEdge | ( | edge * | e | ) |
Definition at line 331 of file Graph.cpp.
References _edges, edge::edgeNum, edge::from, GetNode(), node::RemoveEdge(), and edge::to.
Referenced by RemoveNode(), and ClusterAbstraction::removeNodes().
◆ RemoveNode() [1/3]
Definition at line 356 of file Graph.cpp.
References node::_allEdges, _nodes, node::edgeIterNextIncoming(), node::edgeIterNextOutgoing(), node::getIncomingEdgeIter(), node::GetNum(), node::getOutgoingEdgeIter(), node::nodeNum, and RemoveEdge().
Referenced by IRDijkstra::RefineNode(), IRAStar::RefineNode(), CFOptimalRefinement::RefineNode(), ClusterAbstraction::removeNodes(), and ClusterAbstraction::setUpParents().
◆ RemoveNode() [2/3]
|
inline |
◆ RemoveNode() [3/3]
|
inline |
Definition at line 103 of file Graph.h.
References GetNode(), and RemoveNode().
Referenced by RemoveNode().
◆ Reset()
| void Graph::Reset | ( | ) |
Definition at line 45 of file Graph.cpp.
References _edges, _nodes, edgeIterNext(), getEdgeIter(), getNodeIter(), and nodeIterNext().
Referenced by ~Graph().
◆ Save()
| void Graph::Save | ( | const char * | file | ) |
◆ verifyGraph()
| bool Graph::verifyGraph | ( | ) | const |
Definition at line 496 of file Graph.cpp.
References _edges, _nodes, edgeIterNext(), getEdgeIter(), getNodeIter(), and nodeIterNext().
Member Data Documentation
◆ _edges
|
private |
Definition at line 116 of file Graph.h.
Referenced by AddEdge(), edgeIterNext(), GetEdge(), getEdgeIter(), GetNumEdges(), GetRandomEdge(), RemoveEdge(), Reset(), and verifyGraph().
◆ _nodes
|
private |
Definition at line 114 of file Graph.h.
Referenced by AddEdge(), AddNode(), GetNode(), getNodeIter(), GetNumNodes(), GetRandomNode(), getReachableNodes(), nodeIterNext(), RemoveNode(), Reset(), and verifyGraph().
The documentation for this class was generated from the following files:
