User Documentation |
RAVL, Recognition And Vision Library |
DEVELOP | HOME PAGE | CLASS LIST | CONTENTS |
Ravl - Core - Graphs - GraphLinearIterC<class NodeT,class EdgeT> |
PUBLIC |
GraphLinearIterC::GraphLinearIterC(GraphC GraphLinearIterC::Node(void) GraphLinearIterC::Data(void) GraphBaseLinearIterC::First(void) GraphBaseLinearIterC::Next(void) GraphBaseLinearIterC::operator ++(int) GraphBaseLinearIterC::operator ++(void) GraphBaseLinearIterC::IsElm(void) const GraphBaseLinearIterC::operator bool(void) const GraphBaseLinearIterC::IsCycle(void) const GraphBaseLinearIterC::NodesRemaining(void) const GraphBaseLinearIterC::Node(void) GraphBaseLinearIterC::Node(void) const |
GraphLinearIterC<class NodeT,class EdgeT> | |
Linear graph iterator. | |
include | "Ravl/GraphLinearIter.hh" |
Created: | 9/12/1996 |
User Level: | Normal |
Library: | RavlCore |
In Scope: | RavlN |
Expects the graph to be acyclic.
This effectively does a toplogical sort on the graph.
NB. This class uses the node Markers !! So you can only use single iter at a time.
Parent Classes:
#include "Ravl/GraphBaseLinearIter.hh" |
Maintainer:Charles Galambos, Created: 9/12/1996, Documentation by CxxDoc: Tue Aug 13 09:59:02 2002 |