PUBLIC

GraphNodeHC::GraphNodeHC(void) GraphNodeHC::GraphNodeHC(const GraphNodeHC &) GraphNodeHC::GraphNodeHC(const GraphNodeIterC &) GraphNodeHC::GraphNodeHC(GraphNodeDatC &) GraphNodeHC::IsValid(void) const GraphNodeHC::operator=(const GraphNodeHC &) GraphNodeHC::operator=(const GraphNodeIterC &) GraphNodeHC::operator==(const GraphNodeHC &) const GraphNodeHC::operator!=(const GraphNodeHC &) const GraphNodeHC::Data(void) GraphNodeHC::Data(void) const GraphNodeHC::In(void) GraphNodeHC::Out(void) GraphNodeHC::Invalidate(void) GraphNodeHC::Del(void) GraphNodeHC::NodeRep(void) const GraphNodeHC::NodeRef(void) GraphNodeHC::GraphNodeHC(const GraphNodeC &) GraphNodeHC::Hash(void) const

GraphNodeHC<class NodeT,class EdgeT>
Node handle.
include	"amma/GraphNode.hh"
User Level:	Default
Library:	Mgraph
Example:	exBiHash.cc
Section:	Containers.Graphs
In Scope:	std

Comments:
Handle for a single node in a graph.

GraphNodeDatC * Node;

GraphNodeHC()

Default constructor.

GraphNodeHC(const GraphNodeHC<NodeT,EdgeT> & Oth)

Copy constructor.

GraphNodeHC(const GraphNodeIterC<NodeT,EdgeT> & Oth)

Construct from a node iter.

GraphNodeHC(GraphNodeDatC<NodeT,EdgeT> & Rep)

Construct form a node rep.

BooleanT IsValid() const

Is a valid handle ?

const GraphNodeHC<NodeT,EdgeT> & operator=(const GraphNodeHC<NodeT,EdgeT> & Oth)

Assigment.

const GraphNodeHC<NodeT,EdgeT> & operator=(const GraphNodeIterC<NodeT,EdgeT> & Oth)

Assignment.

BooleanT operator==(const GraphNodeHC<NodeT,EdgeT> & Oth) const

Comparison.

BooleanT operator!=(const GraphNodeHC<NodeT,EdgeT> & Oth) const

Comparison.

NodeT & Data(void)

Access data.

const NodeT & Data(void) const

Access data.

GraphAdjIterC<NodeT,EdgeT> In()

Returns the iterator that is set to the first item of the list of the graph adjacencies in which this node is the target node.

GraphAdjIterC<NodeT,EdgeT> Out()

Returns the iterator that is set to the first item of the list of the graph adjacencies in which this node is the source node.

void Invalidate()

Invalidate handle, IsValid() will return false after this call until the handle is assigmed to another node.

void Del()

Unlinks edge from the graph and deletes it. The iterator will point to the previous edge in the graph edge list.

GraphNodeRepC & NodeRep() const

Returns the node.

GraphNodeDatC<NodeT,EdgeT> & NodeRef()

Returns the node. protected:

GraphNodeHC(const GraphNodeC & ANode)

Construct from a base node iterator.

UIntT Hash() const

Get hash value for node.