HOG2: edge Class Reference

HOG2

Edge class for connections between node in a Graph. More...

#include <Graph.h>

Inheritance diagram for edge:

Inheritance graph

[legend]

Collaboration diagram for edge:

Collaboration graph

[legend]

Public Member Functions
	edge (unsigned int, unsigned int, double)

graph_object *	Clone () const

void	SetLabelF (unsigned int index, double val)

void	SetLabelL (unsigned int index, long val)

double	GetLabelF (unsigned int index) const

long	GetLabelL (unsigned int index) const

double	GetWeight ()

void	setWeight (double val)

unsigned int	getFrom () const

unsigned int	getTo () const

void	setMarked (bool marked)

bool	getMarked ()

int	getEdgeNum () const

void	Print (std::ostream &) const

Public Member Functions inherited from graph_object
	graph_object ()

virtual	~graph_object ()

virtual double	GetKey ()

Private Attributes
bool	mark

unsigned int	from

unsigned int	to

unsigned int	edgeNum

std::vector< labelValue >	label

Friends
class	Graph

Additional Inherited Members
Public Attributes inherited from graph_object
unsigned int	key

Detailed Description

Edge class for connections between node in a Graph.

Definition at line 129 of file Graph.h.

Constructor & Destructor Documentation

◆ edge()

edge::edge	(	unsigned int	f,
		unsigned int	t,
		double	w
	)

Definition at line 570 of file Graph.cpp.

References kEdgeWeight, and SetLabelF().

Referenced by Clone().

Member Function Documentation

◆ Clone()

graph_object* edge::Clone ( ) const

inlinevirtual

Implements graph_object.

Definition at line 132 of file Graph.h.

References edge(), from, GetLabelF(), kEdgeWeight, and to.

Referenced by Graph::cloneAll().

◆ getEdgeNum()

int edge::getEdgeNum ( ) const

inline

Definition at line 152 of file Graph.h.

References edgeNum.

Referenced by clusterUtil::EdgeEqual::operator()(), and clusterUtil::EdgeHash::operator()().

◆ getFrom()

unsigned int edge::getFrom ( ) const

inline

Definition at line 146 of file Graph.h.

References from.

Referenced by MapCliqueAbstraction::abstractUpEdge(), LoadedCliqueAbstraction::abstractUpEdge(), Graph::AddEdge(), node::AddEdge(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), CanonicalGraphEnvironment::ComputeOrdering(), WeightedMap2DEnvironment::DrawEdge(), Graph::Export(), aStarOld::extractBestPath(), corridorAStar::extractBestPath(), FringeSearch::extractBestPath(), Graph::FindEdge(), MapCliqueAbstraction::findEdgeParent(), LoadedCliqueAbstraction::findEdgeParent(), FloydWarshall(), praStar::getAbstractPath(), CanonicalGraphEnvironment::GetSuccessors(), MapCliqueAbstraction::insertNodeIntoHierarchy(), LoadedCliqueAbstraction::insertNodeIntoHierarchy(), MapCliqueAbstraction::mergeGroupIntoNeighbor(), LoadedCliqueAbstraction::mergeGroupIntoNeighbor(), Prim(), Graph::relax(), Graph::relaxReverseEdge(), MapCliqueAbstraction::RemoveEdge(), and LoadedCliqueAbstraction::RemoveEdge().

◆ GetLabelF()

double edge::GetLabelF ( unsigned int index ) const

inline

Definition at line 137 of file Graph.h.

References label, and MAXINT.

Referenced by Clone(), GetWeight(), and Print().

◆ GetLabelL()

long edge::GetLabelL ( unsigned int index ) const

inline

◆ getMarked()

bool edge::getMarked ( )

inline

Definition at line 150 of file Graph.h.

References mark.

Referenced by Prim().

◆ getTo()

unsigned int edge::getTo ( ) const

inline

Definition at line 147 of file Graph.h.

References to.

Referenced by MapCliqueAbstraction::abstractUpEdge(), LoadedCliqueAbstraction::abstractUpEdge(), Graph::AddEdge(), node::AddEdge(), MapCliqueAbstraction::cliqueAbstractGraph(), LoadedCliqueAbstraction::cliqueAbstractGraph(), CanonicalGraphEnvironment::ComputeOrdering(), WeightedMap2DEnvironment::DrawEdge(), Graph::Export(), aStarOld::extractBestPath(), corridorAStar::extractBestPath(), FringeSearch::extractBestPath(), Graph::findDirectedEdge(), Graph::FindEdge(), MapCliqueAbstraction::findEdgeParent(), LoadedCliqueAbstraction::findEdgeParent(), FloydWarshall(), praStar::getAbstractPath(), CanonicalGraphEnvironment::GetSuccessors(), MapCliqueAbstraction::insertNodeIntoHierarchy(), LoadedCliqueAbstraction::insertNodeIntoHierarchy(), MapCliqueAbstraction::mergeGroupIntoNeighbor(), LoadedCliqueAbstraction::mergeGroupIntoNeighbor(), Prim(), Graph::relax(), Graph::relaxReverseEdge(), and node::RemoveEdge().

◆ GetWeight()

double edge::GetWeight ( )

inline

Definition at line 140 of file Graph.h.

References GetLabelF(), and kEdgeWeight.

Referenced by FringeSearch::addCosts(), aStar::addToOpenList(), CanonicalGraphEnvironment::ComputeOrdering(), GraphDistanceHeuristic::ComputeSizes(), IRAStar::ExpandNeighbors(), Graph::Export(), GraphDistanceHeuristic::FindBestChild(), GraphDistanceHeuristic::FindFarNode(), FloydWarshall(), CanonicalGraphEnvironment::GCost(), GraphEnvironment::GCost(), GraphDistanceHeuristic::GetOptimalDistances(), IRAStar::GetSolution(), AbstractionSearchEnvironment::heuristic(), OldSearchCode::GraphSearchEnvironment::heuristic(), IRAStar::Inconsistent(), Compare::operator()(), CFOptimalRefinement::RefineNode(), Graph::relax(), aStarOld::relaxEdge(), corridorAStar::relaxEdge(), praStar::relaxEdge(), Graph::relaxReverseEdge(), RoadMap::RoadMap(), FringeSearch::updateCosts(), CFOptimalRefinement::UpdateG(), CFOptimalRefinement::UpdateH(), CFOptimalRefinement::UpdateOptH(), and aStar::updateWeight().

◆ Print()

void edge::Print ( std::ostream & ) const

virtual

Reimplemented from graph_object.

Definition at line 578 of file Graph.cpp.

References from, GetLabelF(), kEdgeWeight, and to.

Referenced by operator<<().

◆ SetLabelF()

void edge::SetLabelF	(	unsigned int	index,
		double	val
	)

Definition at line 583 of file Graph.cpp.

References labelValue::fval, label, and MAXINT.

Referenced by edge(), and setWeight().

◆ SetLabelL()

void edge::SetLabelL	(	unsigned int	index,
		long	val
	)

◆ setMarked()

void edge::setMarked ( bool marked )

inline

Definition at line 149 of file Graph.h.

References mark.

Referenced by craStar::doRefinement(), aStarOld::extractBestPath(), corridorAStar::extractBestPath(), FringeSearch::extractBestPath(), aStar::extractPathToStart(), praStar::getAbstractPath(), craStar::getNextNode(), and Prim().

◆ setWeight()

void edge::setWeight ( double val )

inline

Definition at line 141 of file Graph.h.

References kEdgeWeight, and SetLabelF().

Referenced by RoadMap::RoadMap().

Friends And Related Function Documentation

◆ Graph

friend class Graph

friend

Definition at line 156 of file Graph.h.

Member Data Documentation

◆ edgeNum

unsigned int edge::edgeNum

private

Definition at line 161 of file Graph.h.

Referenced by Graph::AddEdge(), getEdgeNum(), and Graph::RemoveEdge().

◆ from

unsigned int edge::from

private

Definition at line 158 of file Graph.h.

Referenced by Clone(), getFrom(), Print(), and Graph::RemoveEdge().

◆ label

std::vector<labelValue> edge::label

private

Definition at line 163 of file Graph.h.

Referenced by GetLabelF(), GetLabelL(), SetLabelF(), and SetLabelL().

◆ mark

bool edge::mark

private

Definition at line 157 of file Graph.h.

Referenced by getMarked(), and setMarked().

◆ to

unsigned int edge::to

private

Definition at line 158 of file Graph.h.

Referenced by Clone(), getTo(), Print(), and Graph::RemoveEdge().

The documentation for this class was generated from the following files:

/home/sturtevant/nightly/hog2/graph/Graph.h
/home/sturtevant/nightly/hog2/graph/Graph.cpp