User Documentation
RAVL, Recognition And Vision Library
DEVELOP HOME PAGE CLASS LIST CONTENTS
Ravl - Core - Graphs - GraphBaseConnIterC
 

  PUBLIC
GraphBaseConnIterC::GraphBaseConnIterC(void)
GraphBaseConnIterC::GraphBaseConnIterC(const GraphNodeBaseC &)
GraphBaseConnIterC::GraphBaseConnIterC(const GraphBaseConnIterC &)
GraphBaseConnIterC::First(const GraphNodeBaseC &)
GraphBaseConnIterC::Next(void)
GraphBaseConnIterC::Prune(void)
GraphBaseConnIterC::IsElm(void) const
GraphBaseConnIterC::IsVisited(const GraphNodeBaseC &) const
GraphBaseConnIterC::Visited(const GraphNodeBaseC &)
GraphBaseConnIterC::AddOpen(const GraphNodeBaseC &)
GraphBaseConnIterC::Data(void)
GraphBaseConnIterC::Data(void) const

   GraphBaseConnIterC   
 
Connected node iterator
 
include "Ravl/GraphBConIt.hh"
Created:12/12/1996 
User Level:Develop
Library:RavlCore
In Scope:RavlN

Comments:
Iterate all nodes that maybe reached from the given starting point (This may not necessarily include the start point itself).

Derived Classes: Variables:
Methods:
GraphBaseConnIterC()
Default constructor.

GraphBaseConnIterC(const GraphNodeBaseC & Start)
Constructor.

GraphBaseConnIterC(const GraphBaseConnIterC & Oth)
Copy constructor.

void First(const GraphNodeBaseC & Nd)
Goto first node.

void Next(void)
Goto next node, add current nodes outgoing links to those in the open list.

void Prune(void)
Move to next node, don't include this nodes children for iteration.

bool IsElm(void) const
At valid element.

bool IsVisited(const GraphNodeBaseC & Nd) const
Have visited node ?

void Visited(const GraphNodeBaseC & Nd)
Flag node as being visited.

bool AddOpen(const GraphNodeBaseC & Nd)
Add node to open list.

GraphNodeBaseC & Data(void)
Get some data.

const GraphNodeBaseC & Data(void) const
Get some data.


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