User Documentation
Centre for Vision, Speech & Signal Processing
DEVELOP IN NAMESPACE AMMA TREE ROOT AMMA SEARCH AMMA HOME
 

  PUBLIC
BGraphNodeHC::BGraphNodeHC(void)
BGraphNodeHC::BGraphNodeHC(BGraphNodeC &)
BGraphNodeHC::BGraphNodeHC(BGraphC &,BGraphTypesC::NodeHandleT)
BGraphNodeHC::operator=(const BGraphNodeHC &)
BGraphNodeHC::IsValid(void) const
BGraphNodeHC::Node(void)
BGraphNodeHC::Node(void) const
BGraphNodeHC::Data(void)
BGraphNodeHC::Data(void) const
BGraphNodeHC::operator==(const BGraphNodeHC &) const
BGraphNodeHC::operator==(BGraphTypesC::NodeHandleT) const
BGraphNodeHC::Out(BGraphC &)
BGraphNodeHC::In(BGraphC &)
BGraphNodeHC::Invalidate(void)
BGraphNodeHC::Hash(void) const
BGraphNodeHC::ID(void) const
BGraphNodeHC<class NT,class ET>
 
BGraph node handle
 
include "amma/BGraphNode.hh"
User Level:Default
Library:Branch
Example:exBiHash.cc
Section:Containers.Graphs.Branching
In Scope:std

Parent Classes:

Variables:
Methods:
BGraphNodeHC()
Default constructor.

BGraphNodeHC(BGraphNodeC<NT,ET> & annode)
Default constructor.

BGraphNodeHC(BGraphC<NT,ET> & g,BGraphTypesC::NodeHandleT nd)
Default constructor.

const BGraphNodeHC<NT,ET> & operator=(const BGraphNodeHC<NT,ET> & oth)
Assignment.

BooleanT IsValid() const
Is handle valid ?

BGraphNodeC<NT,ET> & Node()
Get Node.

const BGraphNodeC<NT,ET> & Node() const
Get Node.

NT & Data()
Access data.

const NT & Data() const
Constant access to data.

BooleanT operator==(const BGraphNodeHC<NT,ET> & oth) const
Comparison.

BooleanT operator==(BGraphTypesC::NodeHandleT oth) const
Comparison.

BGraphAdjIterC<NT,ET> Out(BGraphC<NT,ET> & G)
Get links leaving node.

BGraphAdjIterC<NT,ET> In(BGraphC<NT,ET> & G)
Get links entering node.

void Invalidate()
Invalidate handle.

UIntT Hash() const
Get hash value.

IndexT ID() const
Get nodes ID.


Programmer:Charles Galambos, Documentation by CxxDoc: Tue Mar 20 10:48:08 2001