User Documentation
RAVL, Recognition And Vision Library
DEVELOP HOME PAGE CLASS LIST CONTENTS
Ravl - Core - Graphs - GraphNodeHC<class NodeT,class EdgeT>
 

  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 GraphNodeBaseC &)
GraphNodeHC::Hash(void) const

   GraphNodeHC<class NodeT,class EdgeT>   
 
Node handle.
 
include "Ravl/GraphNode.hh"
Created:10/12/1996 
User Level:Normal
Library:RavlCore
Example:exGraph.cc
In Scope:RavlN

Comments:
Handle for a single node in a graph.

Variables:
Methods:
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.

bool 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.

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

bool 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.

GraphNodeBaseBodyC & NodeRep() const
Returns the node.

GraphNodeDatC<NodeT,EdgeT> & NodeRef()
Returns the node. protected:

GraphNodeHC(const GraphNodeBaseC & ANode)
Construct from a base node iterator.

UIntT Hash() const
Get hash value for node.


Maintainer:Charles Galambos, Created: 10/12/1996, Documentation by CxxDoc: Tue Aug 13 09:59:02 2002