VTK
|
depth first iterator through a vtkGraph More...
#include <vtkTreeDFSIterator.h>
Inherits vtkTreeIterator.
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.
typedef vtkTreeIterator vtkTreeDFSIterator::Superclass |
Definition at line 53 of file vtkTreeDFSIterator.h.
Enumerator | |
---|---|
DISCOVER | |
FINISH |
Definition at line 57 of file vtkTreeDFSIterator.h.
|
protected |
Enumerator | |
---|---|
WHITE | |
GRAY | |
BLACK |
Definition at line 87 of file vtkTreeDFSIterator.h.
|
protected |
|
protected |
|
static |
|
static |
|
virtual |
|
static |
|
protectedvirtual |
vtkTreeDFSIterator* vtkTreeDFSIterator::NewInstance | ( | ) | const |
|
virtual |
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 |
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.
|
protectedvirtual |
|
protectedvirtual |
|
protected |
Definition at line 81 of file vtkTreeDFSIterator.h.
|
protected |
Definition at line 82 of file vtkTreeDFSIterator.h.
|
protected |
Definition at line 83 of file vtkTreeDFSIterator.h.
|
protected |
Definition at line 84 of file vtkTreeDFSIterator.h.