HOG2
Public Member Functions | Private Attributes | Static Private Attributes | Friends | List of all members
node Class Reference

Nodes to be stored within a Graph. More...

#include <Graph.h>

Inheritance diagram for node:
Inheritance graph
[legend]
Collaboration diagram for node:
Collaboration graph
[legend]

Public Member Functions

 node (const char *)
 
graph_object * Clone () const
 
const char * GetName () const
 
unsigned int GetNum () const
 
int getUniqueID () const
 
void AddEdge (edge *)
 
void RemoveEdge (edge *)
 
edge * edgeIterNextIncoming (edge_iterator &) const
 
edge_iterator getIncomingEdgeIter () const
 
edge * edgeIterNextOutgoing (edge_iterator &) const
 
edge_iterator getOutgoingEdgeIter () const
 
edge * edgeIterNext (edge_iterator &) const
 
edge_iterator getEdgeIter () const
 
edge * getEdge (unsigned int which)
 
neighbor_iterator getNeighborIter () const
 
int nodeNeighborNext (neighbor_iterator &) const
 
edge * getRandomIncomingEdge ()
 
edge * getRandomOutgoingEdge ()
 
edge * GetRandomEdge ()
 
int getNumOutgoingEdges ()
 
int getNumIncomingEdges ()
 
int GetNumEdges ()
 
void SetKeyLabel (int which)
 
int GetKeyLabel ()
 
double GetKey ()
 
void SetLabelF (unsigned int index, double val) const
 
void SetLabelL (unsigned int index, long val) const
 
double GetLabelF (unsigned int index) const
 
long GetLabelL (unsigned int index) const
 
void markEdge (edge *e)
 
edge * getMarkedEdge ()
 
void Print (std::ostream &) const
 
- Public Member Functions inherited from graph_object
 graph_object ()
 
virtual ~graph_object ()
 

Private Attributes

unsigned int nodeNum
 
std::vector< labelValue > label
 
edge * markedEdge
 
std::vector< edge * > _edgesOutgoing
 
std::vector< edge * > _edgesIncoming
 
std::vector< edge * > _allEdges
 
char name [30]
 
int keyLabel
 
int uniqueID
 

Static Private Attributes

static unsigned int uniqueIDCounter = 0
 

Friends

class Graph
 

Additional Inherited Members

- Public Attributes inherited from graph_object
unsigned int key
 

Detailed Description

Nodes to be stored within a Graph.

Definition at line 170 of file Graph.h.

Constructor & Destructor Documentation

◆ node()

node::node ( const char *  n)

Definition at line 616 of file Graph.cpp.

References keyLabel, markedEdge, name, uniqueID, and uniqueIDCounter.

Referenced by Clone().

Member Function Documentation

◆ AddEdge()

void node::AddEdge ( edge *  e)

Definition at line 636 of file Graph.cpp.

References _allEdges, _edgesIncoming, _edgesOutgoing, edge::getFrom(), edge::getTo(), and nodeNum.

◆ Clone()

graph_object * node::Clone ( ) const
virtual

Implements graph_object.

Definition at line 628 of file Graph.cpp.

References keyLabel, label, name, and node().

Referenced by Graph::Clone(), and Graph::cloneAll().

◆ edgeIterNext()

edge * node::edgeIterNext ( edge_iterator &  iter) const

Definition at line 754 of file Graph.cpp.

References _allEdges.

Referenced by aStar::addNeighborsToCorridor(), MapCliqueAbstraction::addNodesToParent(), LoadedCliqueAbstraction::addNodesToParent(), praStar::astar(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), Graph::FindEdge(), MapCliqueAbstraction::findNeighborCliques(), LoadedCliqueAbstraction::findNeighborCliques(), GraphEnvironment::GetActions(), MapCliqueAbstraction::getChildGroups(), LoadedCliqueAbstraction::getChildGroups(), GetMapGraph(), aStarOld::GetPath(), FringeSearch::GetPath(), aStar::getPathToNode(), GraphEnvironment::GetSuccessors(), MapCliqueAbstraction::insertNodeIntoHierarchy(), LoadedCliqueAbstraction::insertNodeIntoHierarchy(), MapCliqueAbstraction::mergeGroupIntoNeighbor(), LoadedCliqueAbstraction::mergeGroupIntoNeighbor(), GraphEnvironment::OpenGLDraw(), FringeSearch::propagateGValues(), FringeSearch::propagateHValues(), MapCliqueAbstraction::RemoveNode(), LoadedCliqueAbstraction::RemoveNode(), ClusterAbstraction::removeNodes(), MapCliqueAbstraction::resetLocationCache(), MapCliqueAbstraction::transferGroup(), and LoadedCliqueAbstraction::transferGroup().

◆ edgeIterNextIncoming()

edge * node::edgeIterNextIncoming ( edge_iterator &  iterIncoming) const

Definition at line 722 of file Graph.cpp.

References _edgesIncoming.

Referenced by Graph::RemoveNode().

◆ edgeIterNextOutgoing()

edge * node::edgeIterNextOutgoing ( edge_iterator &  iterOutgoing) const

Definition at line 738 of file Graph.cpp.

References _edgesOutgoing.

Referenced by Graph::findDirectedEdge(), GraphEnvironment::GetActions(), OldSearchCode::MapGraphSearchEnvironment::getNeighbors(), GraphEnvironment::GetSuccessors(), and Graph::RemoveNode().

◆ getEdge()

edge * node::getEdge ( unsigned int  which)

Definition at line 794 of file Graph.cpp.

References _allEdges.

Referenced by CanonicalGraphEnvironment::ComputeOrdering(), CanonicalGraphEnvironment::GetSuccessors(), MapCliqueAbstraction::insertNodeIntoHierarchy(), LoadedCliqueAbstraction::insertNodeIntoHierarchy(), and Prim().

◆ getEdgeIter()

edge_iterator node::getEdgeIter ( ) const

Definition at line 749 of file Graph.cpp.

References _allEdges.

Referenced by aStar::addNeighborsToCorridor(), MapCliqueAbstraction::addNodesToParent(), LoadedCliqueAbstraction::addNodesToParent(), praStar::astar(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), Graph::FindEdge(), MapCliqueAbstraction::findNeighborCliques(), LoadedCliqueAbstraction::findNeighborCliques(), GraphEnvironment::GetActions(), MapCliqueAbstraction::getChildGroups(), LoadedCliqueAbstraction::getChildGroups(), GetMapGraph(), aStarOld::GetPath(), FringeSearch::GetPath(), aStar::getPathToNode(), GraphEnvironment::GetSuccessors(), MapCliqueAbstraction::insertNodeIntoHierarchy(), LoadedCliqueAbstraction::insertNodeIntoHierarchy(), MapCliqueAbstraction::mergeGroupIntoNeighbor(), LoadedCliqueAbstraction::mergeGroupIntoNeighbor(), GraphEnvironment::OpenGLDraw(), FringeSearch::propagateGValues(), FringeSearch::propagateHValues(), MapCliqueAbstraction::RemoveNode(), LoadedCliqueAbstraction::RemoveNode(), ClusterAbstraction::removeNodes(), MapCliqueAbstraction::resetLocationCache(), MapCliqueAbstraction::transferGroup(), and LoadedCliqueAbstraction::transferGroup().

◆ getIncomingEdgeIter()

edge_iterator node::getIncomingEdgeIter ( ) const

Definition at line 717 of file Graph.cpp.

References _edgesIncoming.

Referenced by Graph::RemoveNode().

◆ GetKey()

double node::GetKey ( )
inlinevirtual

Reimplemented from graph_object.

Definition at line 210 of file Graph.h.

References keyLabel, and label.

◆ GetKeyLabel()

int node::GetKeyLabel ( )
inline

Definition at line 209 of file Graph.h.

References keyLabel.

Referenced by Prim().

◆ GetLabelF()

double node::GetLabelF ( unsigned int  index) const
inline

Definition at line 215 of file Graph.h.

References label, and MAXINT.

Referenced by LoadedBBAbstraction::addNeighborsInBox(), praStar::astar(), ClusterAbstraction::computeClusterPaths(), IRDijkstra::DoOneSearchStep(), GraphEnvironment::Draw(), AStarDelay::DrawEdge(), GraphEnvironment::DrawLERP(), GraphEnvironment::DrawLine(), GraphEnvironment::DrawStateLabel(), IRDijkstra::ExpandNeighbors(), GraphMapInconsistentHeuristic::FillInCache(), LoadedBBAbstraction::findBoundingBox(), GraphDistanceHeuristic::FindFarNode(), IRDijkstra::GetAllSolutionNodes(), corridorAStar::getBestPath(), ClusterAbstraction::getClusterIdFromNode(), IRAStar::GetFCost(), IRAStar::GetGCost(), IRAStar::GetHCost(), MeroBUtil::graphGenerator::GetLoc(), PropUtil::graphGenerator::GetLoc(), GraphEnvironment::GetLocation(), LoadedBBAbstraction::GetNodeLoc(), LoadedCliqueAbstraction::GetNodeLoc(), GraphDistanceHeuristic::GetOptimalDistances(), aStarOld::GetPath(), hpaStar::GetPath(), IRDijkstra::GetSolution(), CanonicalGraphEnvironment::GLDrawLine(), GraphEnvironment::GLDrawLine(), GraphEnvironment::GLLabelState(), LoadedBBAbstraction::h(), LoadedCliqueAbstraction::h(), RoadMap::HCost(), GraphLabelHeuristic::HCost(), ClusterAbstraction::insertNode(), ClusterAbstraction::nodeExists(), CanonicalGraphEnvironment::OpenGLDraw(), GraphDistanceHeuristic::OpenGLDraw(), GraphEnvironment::OpenGLDraw(), IRDijkstraConstants::NodeCompare::operator()(), CFOptimalRefinementConstants::NodeCompare::operator()(), IRAStarConstants::NodeCompare::operator()(), ClusterAbstraction::printMapCoord(), Graph::relax(), aStarOld::relaxEdge(), corridorAStar::relaxEdge(), praStar::relaxEdge(), corridorAStar::relaxFinalEdge(), corridorAStar::relaxFirstEdge(), Graph::relaxReverseEdge(), ClusterAbstraction::removeNodes(), RoadMap::RoadMap(), IRDijkstra::SetInitialValues(), CFOptimalRefinement::SetInitialValues(), ClusterAbstraction::setUpParents(), GraphEnvironment::SVGDraw(), GraphEnvironment::SVGLabelState(), CFOptimalRefinement::UpdateG(), CFOptimalRefinement::UpdateH(), CFOptimalRefinement::UpdateOptH(), MapCliqueAbstraction::VerifyHierarchy(), and LoadedCliqueAbstraction::VerifyHierarchy().

◆ GetLabelL()

long node::GetLabelL ( unsigned int  index) const
inline

Definition at line 220 of file Graph.h.

References label, and MAXINT.

Referenced by LoadedBBAbstraction::abstractGraph(), RadiusAbstraction::abstractionBFS(), MapSectorAbstraction::abstractionBFS(), ClusterAbstraction::abstractionBFS(), MapCliqueAbstraction::abstractUpEdge(), LoadedCliqueAbstraction::abstractUpEdge(), MapLineAbstraction::addEdges(), RadiusAbstraction::addEdges(), MapSectorAbstraction::addEdges(), NodeLimitAbstraction::addEdges(), LoadedBBAbstraction::addNeighborsInBox(), MapLineAbstraction::addNodes(), RadiusAbstraction::addNodes(), NodeLimitAbstraction::addNodes(), MapCliqueAbstraction::addNodesToParent(), LoadedCliqueAbstraction::addNodesToParent(), LoadedBBAbstraction::addNodeToParent(), patrolUnit::addPathToCache(), rewardSeekingUnit::addPathToCache(), SearchUnit::addPathToCache(), MapCliqueAbstraction::addTunnel(), LoadedCliqueAbstraction::addTunnel(), praStar::astar(), spreadPRAStar::buildNextAbstractPath(), praStar2::buildNextAbstractPath(), craStar::buildNextAbstractPath(), MapLineAbstraction::buildNodeIntoParent(), RadiusAbstraction::buildNodeIntoParent(), MapSectorAbstraction::buildNodeIntoParent(), NodeLimitAbstraction::buildNodeIntoParent(), ClusterAbstraction::buildNodeIntoParent(), MapCliqueAbstraction::checkAndCreateParent(), LoadedCliqueAbstraction::checkAndCreateParent(), MapCliqueAbstraction::checkNeighborClique(), LoadedCliqueAbstraction::checkNeighborClique(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), GraphAbstraction::ComputeWidth(), ClusterAbstraction::connectedBFS(), GraphOccupancyInterface::Convert(), LoadedBBAbstraction::createNewParent(), MapLineAbstraction::createParent(), CFOptimalRefinement::DoOneSearchStep(), craStar::doRefinement(), WeightedMap2DEnvironment::DrawEdge(), LoadedBBAbstraction::DrawGraph(), LoadedCliqueAbstraction::DrawGraph(), LoadedBBAbstraction::DrawLevelConnections(), LoadedCliqueAbstraction::DrawLevelConnections(), MapCliqueAbstraction::extractGroupIntoNewNode(), LoadedCliqueAbstraction::extractGroupIntoNewNode(), MapCliqueAbstraction::findEdgeParent(), LoadedCliqueAbstraction::findEdgeParent(), craStar::findGoalNode(), hpaStar::findMinMax(), craStar::findMinMax(), MapCliqueAbstraction::findNeighborCliques(), LoadedCliqueAbstraction::findNeighborCliques(), MapCliqueAbstraction::findNodeParent(), LoadedBBAbstraction::findNodeParent(), LoadedCliqueAbstraction::findNodeParent(), AbsGraphEnvironment::GCost(), generatePaths(), GraphAbstraction::GetAbstractGraph(), GraphAbstraction::GetAbstractionLevel(), corridorAStar::getBestPath(), MapCliqueAbstraction::getChildGroups(), LoadedCliqueAbstraction::getChildGroups(), ClusterAbstraction::getClusterIdFromNode(), FringeSearch::getCosts(), MapCliqueAbstraction::getGroupSize(), LoadedCliqueAbstraction::getGroupSize(), MapCliqueAbstraction::getNodeInGroup(), LoadedCliqueAbstraction::getNodeInGroup(), LoadedBBAbstraction::GetNodeLoc(), LoadedCliqueAbstraction::GetNodeLoc(), GraphAbstraction::GetNthChild(), GraphAbstraction::GetNthParent(), GraphAbstraction::GetNumAbstractGraphs(), GraphAbstraction::GetNumChildren(), GraphAbstraction::GetParent(), aStar2::GetPath(), praStar::GetPath(), spreadPRAStar::GetPath(), praStar2::GetPath(), aStarOld::GetPath(), craStar::GetPath(), aStar::GetPath(), AbstractWeightedSearchAlgorithm< state, action, environment >::GetPath(), MapSectorAbstraction::getQuadrant(), IRDijkstra::GetRealNode(), IRAStar::GetRealNode(), CFOptimalRefinement::GetRealNode(), AbsGraphEnvironment::GoalTest(), GraphInconsistencyExamples::GraphHeuristic::HCost(), GraphMapHeuristic::HCost(), AbsGraphEnvironment::HCost(), GraphMapPerfectHeuristic::HCost(), GraphStraightLineHeuristic::HCost(), GraphMapInconsistentHeuristic::HCost(), OctileHeuristic::HCost(), OldSearchCode::MapGraphSearchEnvironment::heuristic(), ClusterSearchEnvironment::inCorridor(), FringeSearch::initializeSearch(), ClusterAbstraction::insertNode(), MapCliqueAbstraction::insertNodeIntoHierarchy(), LoadedCliqueAbstraction::insertNodeIntoHierarchy(), praStarUnit::makeMove(), SearchUnit::makeMove(), CFOptimalRefinement::MakeNeighborsOpen(), GraphAbstraction::MeasureExpectedNodeWidth(), MapCliqueAbstraction::mergeGroupIntoNeighbor(), LoadedCliqueAbstraction::mergeGroupIntoNeighbor(), LoadedCliqueAbstraction::neighborAbstractGraph(), hpaStar::nextPathNode(), craStar::nextPathNode(), CFOptimalRefinement::OpenGLDraw(), GraphEnvironment::OpenGLDraw(), CFOptimalRefinementConstants::NodeCompare::operator()(), RadiusAbstraction::Pathable(), MapSectorAbstraction::Pathable(), LoadedBBAbstraction::Pathable(), MapCliqueAbstraction::Pathable(), LoadedCliqueAbstraction::Pathable(), NodeLimitAbstraction::Pathable(), ClusterAbstraction::Pathable(), AbsGraphEnvironment::Print(), ClusterAbstraction::printMapCoord(), IRDijkstra::RefineNode(), IRAStar::RefineNode(), CFOptimalRefinement::RefineNode(), MapCliqueAbstraction::RemoveNode(), LoadedCliqueAbstraction::RemoveNode(), ClusterAbstraction::removeNodes(), MapCliqueAbstraction::renameNodeInAbstraction(), LoadedCliqueAbstraction::renameNodeInAbstraction(), MapCliqueAbstraction::RepairAbstraction(), LoadedCliqueAbstraction::RepairAbstraction(), MapCliqueAbstraction::resetLocationCache(), LoadedCliqueAbstraction::resetLocationCache(), FringeSearch::setHCost(), ClusterAbstraction::setUpParents(), hpaStar::smoothPath(), craStar::smoothPath(), MapCliqueAbstraction::splitNode(), LoadedCliqueAbstraction::splitNode(), MapCliqueAbstraction::transferGroup(), LoadedCliqueAbstraction::transferGroup(), spreadPRAStar::trimPath(), praStar2::trimPath(), craStar::trimPath(), FringeSearch::updateCosts(), CFOptimalRefinement::UpdateG(), CFOptimalRefinement::UpdateH(), CFOptimalRefinement::UpdateOptH(), LoadedBBAbstraction::VerifyHierarchy(), LoadedCliqueAbstraction::VerifyHierarchy(), and MapCliqueAbstraction::VerifyHierarchy().

◆ getMarkedEdge()

edge* node::getMarkedEdge ( )
inline

Definition at line 228 of file Graph.h.

References markedEdge.

Referenced by aStarOld::extractBestPath(), corridorAStar::extractBestPath(), FringeSearch::extractBestPath(), and praStar::getAbstractPath().

◆ GetName()

const char* node::GetName ( ) const
inline

Definition at line 175 of file Graph.h.

References name.

Referenced by CanonicalGraphEnvironment::ComputeOrdering(), GraphEnvironment::Draw(), CanonicalGraphEnvironment::OpenGLDraw(), and GraphEnvironment::OpenGLDraw().

◆ getNeighborIter()

neighbor_iterator node::getNeighborIter ( ) const

Definition at line 802 of file Graph.cpp.

Referenced by RadiusAbstraction::abstractionBFS(), MapSectorAbstraction::abstractionBFS(), ClusterAbstraction::abstractionBFS(), LoadedBBAbstraction::addNeighborsInBox(), MapLineAbstraction::addNodes(), MapCliqueAbstraction::addTunnel(), LoadedCliqueAbstraction::addTunnel(), MapFlatAbstraction::buildConnectivityGroups(), GraphDistanceHeuristic::ComputeSizes(), ClusterAbstraction::connectedBFS(), craStar::doRefinement(), IRDijkstra::ExpandNeighbors(), IRAStar::ExpandNeighbors(), GraphMapInconsistentHeuristic::FillInCache(), GraphDistanceHeuristic::FindBestChild(), GraphDistanceHeuristic::FindFarNode(), IRDijkstra::GetAllSolutionNodes(), IRAStar::GetAllSolutionNodes(), corridorAStar::getBestPath(), AbstractionSearchEnvironment::getNeighbors(), ClusterSearchEnvironment::getNeighbors(), OldSearchCode::GraphSearchEnvironment::getNeighbors(), craStar::getNextNode(), GraphAbstraction::GetNumExternalEdges(), GraphDistanceHeuristic::GetOptimalDistances(), Graph::getReachableNodes(), IRDijkstra::GetSolution(), IRAStar::GetSolution(), IRAStar::Inconsistent(), CFOptimalRefinement::MakeNeighborsOpen(), IRDijkstra::RefineNode(), IRAStar::RefineNode(), CFOptimalRefinement::RefineNode(), IRDijkstra::ShouldAddEdge(), IRAStar::ShouldAddEdge(), CFOptimalRefinement::ShouldAddEdge(), CFOptimalRefinement::UpdateG(), CFOptimalRefinement::UpdateH(), and CFOptimalRefinement::UpdateOptH().

◆ GetNum()

unsigned int node::GetNum ( ) const
inline

Definition at line 176 of file Graph.h.

References nodeNum.

Referenced by FringeSearch::addCosts(), GraphDistanceHeuristic::AddHeuristic(), aStar::addNeighborsToCorridor(), MapCliqueAbstraction::addNodesToParent(), LoadedCliqueAbstraction::addNodesToParent(), LoadedBBAbstraction::addNodeToParent(), MapCliqueAbstraction::addTunnel(), LoadedCliqueAbstraction::addTunnel(), praStar::astar(), spreadPRAStar::buildNextAbstractPath(), praStar2::buildNextAbstractPath(), craStar::buildNextAbstractPath(), MapLineAbstraction::buildNodeIntoParent(), RadiusAbstraction::buildNodeIntoParent(), MapSectorAbstraction::buildNodeIntoParent(), NodeLimitAbstraction::buildNodeIntoParent(), ClusterAbstraction::buildNodeIntoParent(), MapCliqueAbstraction::checkAndCreateParent(), LoadedCliqueAbstraction::checkAndCreateParent(), MapCliqueAbstraction::checkNeighborClique(), LoadedCliqueAbstraction::checkNeighborClique(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), ClusterAbstraction::computeClusterPaths(), CanonicalGraphEnvironment::ComputeOrdering(), GraphDistanceHeuristic::ComputeSizes(), GraphAbstraction::CountEdgesAtDistance(), IRDijkstra::DoOneSearchStep(), IRAStar::DoOneSearchStep(), CFOptimalRefinement::DoOneSearchStep(), craStar::doRefinement(), IRDijkstra::ExpandNeighbors(), IRAStar::ExpandNeighbors(), FringeSearch::extractBestPath(), aStar::extractPathToStart(), GraphMapInconsistentHeuristic::FillInCache(), GraphDistanceHeuristic::FindAvoidNode(), GraphDistanceHeuristic::FindBestChild(), MapCliqueAbstraction::findEdgeParent(), LoadedCliqueAbstraction::findEdgeParent(), GraphDistanceHeuristic::FindFarNode(), hpaStar::findMapPath(), MapCliqueAbstraction::findNeighborCliques(), LoadedCliqueAbstraction::findNeighborCliques(), IRDijkstra::GetAllSolutionNodes(), IRAStar::GetAllSolutionNodes(), corridorAStar::getBestPath(), MapCliqueAbstraction::getChildGroups(), LoadedCliqueAbstraction::getChildGroups(), FringeSearch::getCosts(), GetMapGraph(), craStar::getNextNode(), GraphAbstraction::GetNumAbstractGraphs(), GraphDistanceHeuristic::GetOptimalDistances(), aStar2::GetPath(), praStar::GetPath(), spreadPRAStar::GetPath(), aStarOld::GetPath(), praStar2::GetPath(), FringeSearch::GetPath(), craStar::GetPath(), AbstractWeightedSearchAlgorithm< state, action, environment >::GetPath(), aStar::getPathToNode(), GraphInconsistencyExamples::GetPolyGraph(), Graph::getReachableNodes(), IRDijkstra::GetSolution(), IRAStar::GetSolution(), TopSpinGraph::GetState(), CanonicalGraphEnvironment::GetStateHash(), GraphRefinementEnvironment::GetSuccessors(), CanonicalGraphEnvironment::GetSuccessors(), GraphInconsistencyExamples::GetWeightedInconsistency(), GraphRefinementEnvironment::GoalTest(), FringeSearch::h(), IRAStar::Inconsistent(), ClusterAbstraction::insertNode(), MapCliqueAbstraction::insertNodeIntoHierarchy(), LoadedCliqueAbstraction::insertNodeIntoHierarchy(), MapCliqueAbstraction::mergeGroupIntoNeighbor(), LoadedCliqueAbstraction::mergeGroupIntoNeighbor(), FringeSearch::moveToOpenList1(), MyPathfindingKeyHandler(), MyRandomUnitKeyHandler(), hpaStar::nextPathNode(), craStar::nextPathNode(), IRDijkstra::OpenGLDraw(), IRAStar::OpenGLDraw(), WeightedMap2DEnvironment::OpenGLDraw(), MapFlatAbstraction::Pathable(), Prim(), path::Print(), FringeSearch::propagateGValues(), FringeSearch::propagateHValues(), IRDijkstra::RefineNode(), IRAStar::RefineNode(), CFOptimalRefinement::RefineNode(), corridorAStar::relaxEdge(), corridorAStar::relaxFinalEdge(), corridorAStar::relaxFirstEdge(), MapCliqueAbstraction::RemoveNode(), LoadedCliqueAbstraction::RemoveNode(), Graph::RemoveNode(), ClusterAbstraction::removeNodes(), MapCliqueAbstraction::renameNodeInAbstraction(), LoadedCliqueAbstraction::renameNodeInAbstraction(), FringeSearch::setHCost(), IRDijkstra::SetInitialValues(), IRAStar::SetInitialValues(), CFOptimalRefinement::SetInitialValues(), ClusterAbstraction::setUpParents(), spreadPRAStar::setupSearch(), praStar2::setupSearch(), craStar::setupSearch(), MapCliqueAbstraction::transferGroup(), LoadedCliqueAbstraction::transferGroup(), FringeSearch::updateCosts(), CFOptimalRefinement::UpdateG(), CFOptimalRefinement::UpdateH(), CFOptimalRefinement::UpdateOptH(), LoadedBBAbstraction::VerifyHierarchy(), LoadedCliqueAbstraction::VerifyHierarchy(), MapCliqueAbstraction::VerifyHierarchy(), and GraphAbstraction::WidthBFS().

◆ GetNumEdges()

int node::GetNumEdges ( )
inline

Definition at line 204 of file Graph.h.

References getNumIncomingEdges(), and getNumOutgoingEdges().

Referenced by MapCliqueAbstraction::abstractUpEdge(), LoadedCliqueAbstraction::abstractUpEdge(), MapLineAbstraction::addNodes(), MapCliqueAbstraction::addTunnel(), LoadedCliqueAbstraction::addTunnel(), MapCliqueAbstraction::checkNeighborClique(), LoadedCliqueAbstraction::checkNeighborClique(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), CanonicalGraphEnvironment::ComputeOrdering(), path::degree(), craStar::doRefinement(), craStar::getNextNode(), GraphEnvironment::GetNumSuccessors(), CanonicalGraphEnvironment::GetSuccessors(), MapCliqueAbstraction::insertNodeIntoHierarchy(), LoadedCliqueAbstraction::insertNodeIntoHierarchy(), Prim(), Graph::printStats(), ClusterAbstraction::removeNodes(), MapCliqueAbstraction::splitNode(), and LoadedCliqueAbstraction::splitNode().

◆ getNumIncomingEdges()

int node::getNumIncomingEdges ( )

Definition at line 789 of file Graph.cpp.

References _edgesIncoming.

Referenced by MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), GetMapGraph(), and GetNumEdges().

◆ getNumOutgoingEdges()

int node::getNumOutgoingEdges ( )

Definition at line 784 of file Graph.cpp.

References _edgesOutgoing.

Referenced by MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), GetMapGraph(), GetNumEdges(), and GraphEnvironment::GetNumSuccessors().

◆ getOutgoingEdgeIter()

edge_iterator node::getOutgoingEdgeIter ( ) const

Definition at line 733 of file Graph.cpp.

References _edgesOutgoing.

Referenced by Graph::findDirectedEdge(), GraphEnvironment::GetActions(), OldSearchCode::MapGraphSearchEnvironment::getNeighbors(), GraphEnvironment::GetSuccessors(), and Graph::RemoveNode().

◆ GetRandomEdge()

edge * node::GetRandomEdge ( )

Definition at line 777 of file Graph.cpp.

References _allEdges.

◆ getRandomIncomingEdge()

edge * node::getRandomIncomingEdge ( )

Definition at line 765 of file Graph.cpp.

References _edgesIncoming.

◆ getRandomOutgoingEdge()

edge * node::getRandomOutgoingEdge ( )

Definition at line 771 of file Graph.cpp.

References _edgesOutgoing.

◆ getUniqueID()

int node::getUniqueID ( ) const
inline

Definition at line 177 of file Graph.h.

References uniqueID.

Referenced by CanonicalGraphEnvironment::GetActionHash(), GraphEnvironment::GetActionHash(), GraphEnvironment::GetStateHash(), CFOptimalRefinementConstants::NodeEqual::operator()(), IRDijkstraConstants::NodeEqual::operator()(), AStar3Util::NodeEqual::operator()(), AStar3Util::SearchNodeEqual::operator()(), IRAStarConstants::NodeEqual::operator()(), IRDijkstraConstants::NodeHash::operator()(), AStar3Util::NodeHash::operator()(), IRAStarConstants::NodeHash::operator()(), AStar3Util::SearchNodeHash::operator()(), and CFOptimalRefinementConstants::NodeHash::operator()().

◆ markEdge()

void node::markEdge ( edge *  e)
inline

Definition at line 227 of file Graph.h.

References markedEdge.

Referenced by FringeSearch::addCosts(), praStar::astar(), corridorAStar::getBestPath(), aStarOld::GetPath(), aStarOld::relaxEdge(), corridorAStar::relaxEdge(), praStar::relaxEdge(), corridorAStar::relaxFinalEdge(), corridorAStar::relaxFirstEdge(), and FringeSearch::updateCosts().

◆ nodeNeighborNext()

int node::nodeNeighborNext ( neighbor_iterator &  ni) const

Definition at line 807 of file Graph.cpp.

References _edgesIncoming, and _edgesOutgoing.

Referenced by RadiusAbstraction::abstractionBFS(), MapSectorAbstraction::abstractionBFS(), ClusterAbstraction::abstractionBFS(), LoadedBBAbstraction::addNeighborsInBox(), MapLineAbstraction::addNodes(), MapCliqueAbstraction::addTunnel(), LoadedCliqueAbstraction::addTunnel(), MapFlatAbstraction::buildConnectivityGroups(), GraphDistanceHeuristic::ComputeSizes(), ClusterAbstraction::connectedBFS(), craStar::doRefinement(), IRDijkstra::ExpandNeighbors(), IRAStar::ExpandNeighbors(), GraphMapInconsistentHeuristic::FillInCache(), GraphDistanceHeuristic::FindBestChild(), GraphDistanceHeuristic::FindFarNode(), IRDijkstra::GetAllSolutionNodes(), IRAStar::GetAllSolutionNodes(), corridorAStar::getBestPath(), AbstractionSearchEnvironment::getNeighbors(), ClusterSearchEnvironment::getNeighbors(), OldSearchCode::GraphSearchEnvironment::getNeighbors(), craStar::getNextNode(), GraphAbstraction::GetNumExternalEdges(), GraphDistanceHeuristic::GetOptimalDistances(), Graph::getReachableNodes(), IRDijkstra::GetSolution(), IRAStar::GetSolution(), IRAStar::Inconsistent(), CFOptimalRefinement::MakeNeighborsOpen(), IRDijkstra::RefineNode(), IRAStar::RefineNode(), CFOptimalRefinement::RefineNode(), IRDijkstra::ShouldAddEdge(), IRAStar::ShouldAddEdge(), CFOptimalRefinement::ShouldAddEdge(), CFOptimalRefinement::UpdateG(), CFOptimalRefinement::UpdateH(), and CFOptimalRefinement::UpdateOptH().

◆ Print()

void node::Print ( std::ostream &  ) const
virtual

Reimplemented from graph_object.

Definition at line 820 of file Graph.cpp.

References label, name, and nodeNum.

Referenced by operator<<().

◆ RemoveEdge()

void node::RemoveEdge ( edge *  e)

Definition at line 650 of file Graph.cpp.

References _allEdges, _edgesIncoming, _edgesOutgoing, edge::getTo(), markedEdge, and nodeNum.

Referenced by Graph::RemoveEdge().

◆ SetKeyLabel()

void node::SetKeyLabel ( int  which)
inline

Definition at line 208 of file Graph.h.

References keyLabel.

Referenced by praStar::astar(), GraphMapInconsistentHeuristic::FillInCache(), GraphDistanceHeuristic::FindFarNode(), GraphDistanceHeuristic::GetOptimalDistances(), aStarOld::GetPath(), and Prim().

◆ SetLabelF()

void node::SetLabelF ( unsigned int  index,
double  val 
) const

Definition at line 687 of file Graph.cpp.

References labelValue::fval, label, and MAXINT.

Referenced by ClusterAbstraction::addAbsNodes(), RadiusAbstraction::addNodes(), MapSectorAbstraction::addNodes(), NodeLimitAbstraction::addNodes(), GraphSearchConstants::AddNodesToGraph(), praStar::astar(), MapLineAbstraction::buildNodeIntoParent(), RadiusAbstraction::buildNodeIntoParent(), MapSectorAbstraction::buildNodeIntoParent(), NodeLimitAbstraction::buildNodeIntoParent(), MapCliqueAbstraction::checkAndCreateParent(), LoadedCliqueAbstraction::checkAndCreateParent(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), ClusterAbstraction::createConnectivityGraph(), LoadedBBAbstraction::createNewParent(), MapLineAbstraction::createParent(), IRDijkstra::ExpandNeighbors(), MapCliqueAbstraction::extractGroupIntoNewNode(), LoadedCliqueAbstraction::extractGroupIntoNewNode(), GraphMapInconsistentHeuristic::FillInCache(), GraphDistanceHeuristic::FindFarNode(), MeroBUtil::graphGenerator::genFig1(), PropUtil::graphGenerator::genFig1(), MeroBUtil::graphGenerator::genFig2(), PropUtil::graphGenerator::genFig2(), PropUtil::graphGenerator::genFig3(), PropUtil::graphGenerator::genFig4(), corridorAStar::getBestPath(), GraphInconsistencyExamples::GetExpoGraph(), MNPuzzle< width, height >::GetGraph(), GetMapGraph(), LoadedBBAbstraction::GetNodeLoc(), LoadedCliqueAbstraction::GetNodeLoc(), GraphDistanceHeuristic::GetOptimalDistances(), aStarOld::GetPath(), GraphInconsistencyExamples::GetPolyGraph(), GraphInconsistencyExamples::GetWeightedInconsistency(), ClusterAbstraction::insertNode(), LoadedCliqueAbstraction::loadGraph(), LoadedBBAbstraction::loadGraph(), LoadedCliqueAbstraction::neighborAbstractGraph(), Graph::relax(), aStarOld::relaxEdge(), corridorAStar::relaxEdge(), praStar::relaxEdge(), corridorAStar::relaxFinalEdge(), corridorAStar::relaxFirstEdge(), Graph::relaxReverseEdge(), MapCliqueAbstraction::resetLocationCache(), LoadedCliqueAbstraction::resetLocationCache(), RoadMap::RoadMap(), IRAStar::SetGCost(), IRAStar::SetHCost(), IRDijkstra::SetInitialValues(), CFOptimalRefinement::SetInitialValues(), MeroBUtil::graphGenerator::SetLoc(), PropUtil::graphGenerator::SetLoc(), ClusterAbstraction::setUpParents(), CFOptimalRefinement::UpdateG(), and CFOptimalRefinement::UpdateH().

◆ SetLabelL()

void node::SetLabelL ( unsigned int  index,
long  val 
) const

Definition at line 702 of file Graph.cpp.

References label, labelValue::lval, and MAXINT.

Referenced by ClusterAbstraction::addAbsNodes(), FringeSearch::addCosts(), RadiusAbstraction::addNodes(), MapSectorAbstraction::addNodes(), NodeLimitAbstraction::addNodes(), GraphSearchConstants::AddNodesToGraph(), MapCliqueAbstraction::addNodesToParent(), LoadedCliqueAbstraction::addNodesToParent(), LoadedBBAbstraction::addNodeToParent(), MapCliqueAbstraction::addTunnel(), LoadedCliqueAbstraction::addTunnel(), MapLineAbstraction::buildNodeIntoParent(), RadiusAbstraction::buildNodeIntoParent(), MapSectorAbstraction::buildNodeIntoParent(), NodeLimitAbstraction::buildNodeIntoParent(), ClusterAbstraction::buildNodeIntoParent(), MapCliqueAbstraction::checkAndCreateParent(), LoadedCliqueAbstraction::checkAndCreateParent(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), ClusterAbstraction::createConnectivityGraph(), LoadedBBAbstraction::createNewParent(), MapLineAbstraction::createParent(), MapCliqueAbstraction::extractGroupIntoNewNode(), LoadedCliqueAbstraction::extractGroupIntoNewNode(), MapCliqueAbstraction::getChildGroups(), LoadedCliqueAbstraction::getChildGroups(), GraphInconsistencyExamples::GetExpoGraph(), GetMapGraph(), GraphInconsistencyExamples::GetPolyGraph(), ClusterAbstraction::insertNode(), MapCliqueAbstraction::insertNodeIntoHierarchy(), LoadedCliqueAbstraction::insertNodeIntoHierarchy(), LoadedCliqueAbstraction::loadGraph(), LoadedBBAbstraction::loadGraph(), CFOptimalRefinement::MakeNeighborsOpen(), LoadedCliqueAbstraction::neighborAbstractGraph(), MapCliqueAbstraction::RemoveNode(), LoadedCliqueAbstraction::RemoveNode(), MapCliqueAbstraction::renameNodeInAbstraction(), LoadedCliqueAbstraction::renameNodeInAbstraction(), IRDijkstra::SetInitialValues(), IRAStar::SetInitialValues(), CFOptimalRefinement::SetInitialValues(), ClusterAbstraction::setUpParents(), hpaStar::smoothPath(), craStar::smoothPath(), MapCliqueAbstraction::transferGroup(), LoadedCliqueAbstraction::transferGroup(), CFOptimalRefinement::UpdateNode(), and CFOptimalRefinement::UpdateOptH().

Friends And Related Function Documentation

◆ Graph

friend class Graph
friend

Definition at line 232 of file Graph.h.

Member Data Documentation

◆ _allEdges

std::vector<edge *> node::_allEdges
private

Definition at line 238 of file Graph.h.

Referenced by AddEdge(), edgeIterNext(), Graph::FindEdge(), getEdge(), getEdgeIter(), GetRandomEdge(), RemoveEdge(), and Graph::RemoveNode().

◆ _edgesIncoming

std::vector<edge *> node::_edgesIncoming
private

Definition at line 237 of file Graph.h.

Referenced by AddEdge(), edgeIterNextIncoming(), getIncomingEdgeIter(), getNumIncomingEdges(), getRandomIncomingEdge(), nodeNeighborNext(), and RemoveEdge().

◆ _edgesOutgoing

std::vector<edge *> node::_edgesOutgoing
private

Definition at line 236 of file Graph.h.

Referenced by AddEdge(), edgeIterNextOutgoing(), getNumOutgoingEdges(), getOutgoingEdgeIter(), getRandomOutgoingEdge(), nodeNeighborNext(), and RemoveEdge().

◆ keyLabel

int node::keyLabel
private

Definition at line 240 of file Graph.h.

Referenced by Clone(), GetKey(), GetKeyLabel(), node(), and SetKeyLabel().

◆ label

std::vector<labelValue> node::label
mutableprivate

Definition at line 234 of file Graph.h.

Referenced by Clone(), GetKey(), GetLabelF(), GetLabelL(), Print(), SetLabelF(), and SetLabelL().

◆ markedEdge

edge* node::markedEdge
private

Definition at line 235 of file Graph.h.

Referenced by getMarkedEdge(), markEdge(), node(), and RemoveEdge().

◆ name

char node::name[30]
private

Definition at line 239 of file Graph.h.

Referenced by Clone(), GetName(), node(), operator<<(), and Print().

◆ nodeNum

unsigned int node::nodeNum
private

Definition at line 233 of file Graph.h.

Referenced by AddEdge(), Graph::AddNode(), GetNum(), Print(), RemoveEdge(), and Graph::RemoveNode().

◆ uniqueID

int node::uniqueID
private

Definition at line 242 of file Graph.h.

Referenced by getUniqueID(), and node().

◆ uniqueIDCounter

unsigned node::uniqueIDCounter = 0
staticprivate

Definition at line 243 of file Graph.h.

Referenced by node().

The documentation for this class was generated from the following files:
Generated by   doxygen 1.8.17