VTK
|
depth first iterator through a vtkGraph More...
#include <vtkTreeDFSIterator.h>
Public Types | |
enum | ModeType { DISCOVER, FINISH } |
typedef vtkTreeIterator | Superclass |
Public Member Functions | |
virtual int | IsA (const char *type) |
vtkTreeDFSIterator * | NewInstance () const |
virtual void | PrintSelf (ostream &os, vtkIndent indent) |
void | SetMode (int mode) |
virtual int | GetMode () |
Static Public Member Functions | |
static vtkTreeDFSIterator * | New () |
static int | IsTypeOf (const char *type) |
static vtkTreeDFSIterator * | SafeDownCast (vtkObjectBase *o) |
Protected Types | |
enum | ColorType { WHITE, GRAY, BLACK } |
Protected Member Functions | |
virtual vtkObjectBase * | NewInstanceInternal () const |
vtkTreeDFSIterator () | |
~vtkTreeDFSIterator () | |
virtual void | Initialize () |
virtual vtkIdType | NextInternal () |
Protected Attributes | |
int | Mode |
vtkIdType | CurRoot |
vtkTreeDFSIteratorInternals * | Internals |
vtkIntArray * | Color |
depth first iterator through a vtkGraph
vtkTreeDFSIterator performs a depth first search traversal of a tree.
First, you must set the tree on which you are going to iterate, and then optionally set the starting vertex and mode. The mode is either DISCOVER (default), in which case vertices are visited as they are first reached, or FINISH, in which case vertices are visited when they are done, i.e. all adjacent vertices have been discovered already.
After setting up the iterator, the normal mode of operation is to set up a while(iter->HasNext())
loop, with the statement vtkIdType vertex = iter->Next()
inside the loop.
Definition at line 49 of file vtkTreeDFSIterator.h.
Reimplemented from vtkTreeIterator.
Definition at line 53 of file vtkTreeDFSIterator.h.
Definition at line 57 of file vtkTreeDFSIterator.h.
enum vtkTreeDFSIterator::ColorType [protected] |
Definition at line 87 of file vtkTreeDFSIterator.h.
vtkTreeDFSIterator::vtkTreeDFSIterator | ( | ) | [protected] |
vtkTreeDFSIterator::~vtkTreeDFSIterator | ( | ) | [protected] |
static vtkTreeDFSIterator* vtkTreeDFSIterator::New | ( | ) | [static] |
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
Reimplemented from vtkObject.
static int vtkTreeDFSIterator::IsTypeOf | ( | const char * | name | ) | [static] |
Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.
Reimplemented from vtkTreeIterator.
virtual int vtkTreeDFSIterator::IsA | ( | const char * | name | ) | [virtual] |
Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.
Reimplemented from vtkTreeIterator.
static vtkTreeDFSIterator* vtkTreeDFSIterator::SafeDownCast | ( | vtkObjectBase * | o | ) | [static] |
Reimplemented from vtkTreeIterator.
virtual vtkObjectBase* vtkTreeDFSIterator::NewInstanceInternal | ( | ) | const [protected, virtual] |
Reimplemented from vtkTreeIterator.
Reimplemented from vtkTreeIterator.
virtual void vtkTreeDFSIterator::PrintSelf | ( | ostream & | os, |
vtkIndent | indent | ||
) | [virtual] |
Methods invoked by print to print information about the object including superclasses. Typically not called by the user (use Print() instead) but used in the hierarchical print process to combine the output of several classes.
Reimplemented from vtkTreeIterator.
void vtkTreeDFSIterator::SetMode | ( | int | mode | ) |
Set the visit mode of the iterator. Mode can be DISCOVER (0): Order by discovery time FINISH (1): Order by finish time Default is DISCOVER. Use DISCOVER for top-down algorithms where parents need to be processed before children. Use FINISH for bottom-up algorithms where children need to be processed before parents.
virtual int vtkTreeDFSIterator::GetMode | ( | ) | [virtual] |
Set the visit mode of the iterator. Mode can be DISCOVER (0): Order by discovery time FINISH (1): Order by finish time Default is DISCOVER. Use DISCOVER for top-down algorithms where parents need to be processed before children. Use FINISH for bottom-up algorithms where children need to be processed before parents.
virtual void vtkTreeDFSIterator::Initialize | ( | ) | [protected, virtual] |
Implements vtkTreeIterator.
virtual vtkIdType vtkTreeDFSIterator::NextInternal | ( | ) | [protected, virtual] |
Implements vtkTreeIterator.
int vtkTreeDFSIterator::Mode [protected] |
Definition at line 81 of file vtkTreeDFSIterator.h.
vtkIdType vtkTreeDFSIterator::CurRoot [protected] |
Definition at line 82 of file vtkTreeDFSIterator.h.
vtkTreeDFSIteratorInternals* vtkTreeDFSIterator::Internals [protected] |
Definition at line 83 of file vtkTreeDFSIterator.h.
vtkIntArray* vtkTreeDFSIterator::Color [protected] |
Definition at line 84 of file vtkTreeDFSIterator.h.