Entry in the adjacency map storing parent, child, edge, distance, and children set. More...

Collaboration diagram for HyperDijkstra::AdjacencyMapEntry:

Public Member Functions
	AdjacencyMapEntry (HyperGraph::HGVertex _child=0, HyperGraph::HGVertex _parent=0, HyperGraph::HGEdge *_edge=0, g_type _distance=std::numeric_limits< g_type >::max())
	Constructs an adjacency map entry.
HyperGraph::HGVertex *	child () const
	Returns the child vertex.
Set< HyperGraph::HGVertex * > &	children ()
	Returns the mutable set of child vertices.
const Set< HyperGraph::HGVertex * > &	children () const
	Returns the const set of child vertices.
g_type	distance () const
	Returns the distance from the source vertex.
HyperGraph::HGEdge *	edge () const
	Returns the connecting edge.
HyperGraph::HGVertex *	parent () const
	Returns the parent vertex.

Protected Attributes
HyperGraph::HGVertex *	_child
	The child vertex in the shortest-path tree.
Set< HyperGraph::HGVertex * >	_children
	Set of child vertices reachable from this entry.
g_type	_distance
	Accumulated distance from the source.
HyperGraph::HGEdge *	_edge
	The edge connecting parent to child.
HyperGraph::HGVertex *	_parent
	The parent vertex in the shortest-path tree.

Detailed Description

Entry in the adjacency map storing parent, child, edge, distance, and children set.

Definition at line 69 of file hyper_dijkstra.h.

Constructor & Destructor Documentation

HyperDijkstra::AdjacencyMapEntry::AdjacencyMapEntry	(	HyperGraph::HGVertex *	_child = 0,
		HyperGraph::HGVertex *	_parent = 0,
		HyperGraph::HGEdge *	_edge = 0,
		g_type	_distance = std::numeric_limits< g_type >::max() )

Constructs an adjacency map entry.

Parameters

The documentation for this struct was generated from the following file: