vtkGroupLeafVertices Class Reference
#include <vtkGroupLeafVertices.h>
Detailed Description
Filter that expands a tree, categorizing leaf vertices.Use SetInputArrayToProcess(0, ...) to set the array to group on. Currently this array must be a vtkStringArray.
Definition at line 36 of file vtkGroupLeafVertices.h.
Public Types | |
| typedef vtkTreeAlgorithm | Superclass |
Public Member Functions | |
| virtual const char * | GetClassName () |
| virtual int | IsA (const char *type) |
| void | PrintSelf (ostream &os, vtkIndent indent) |
| virtual void | SetGroupDomain (const char *) |
| virtual char * | GetGroupDomain () |
Static Public Member Functions | |
| static vtkGroupLeafVertices * | New () |
| static int | IsTypeOf (const char *type) |
| static vtkGroupLeafVertices * | SafeDownCast (vtkObject *o) |
Protected Member Functions | |
| vtkGroupLeafVertices () | |
| ~vtkGroupLeafVertices () | |
| int | RequestData (vtkInformation *, vtkInformationVector **, vtkInformationVector *) |
Protected Attributes | |
| char * | GroupDomain |
Member Typedef Documentation
Constructor & Destructor Documentation
| vtkGroupLeafVertices::vtkGroupLeafVertices | ( | ) | [protected] |
| vtkGroupLeafVertices::~vtkGroupLeafVertices | ( | ) | [protected] |
Member Function Documentation
| static vtkGroupLeafVertices* vtkGroupLeafVertices::New | ( | ) | [static] |
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
Reimplemented from vtkTreeAlgorithm.
| virtual const char* vtkGroupLeafVertices::GetClassName | ( | ) | [virtual] |
Reimplemented from vtkTreeAlgorithm.
| static int vtkGroupLeafVertices::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 vtkTreeAlgorithm.
| virtual int vtkGroupLeafVertices::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 vtkTreeAlgorithm.
| static vtkGroupLeafVertices* vtkGroupLeafVertices::SafeDownCast | ( | vtkObject * | o | ) | [static] |
Reimplemented from vtkTreeAlgorithm.
| void vtkGroupLeafVertices::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 vtkTreeAlgorithm.
| virtual void vtkGroupLeafVertices::SetGroupDomain | ( | const char * | ) | [virtual] |
The name of the domain that non-leaf vertices will be assigned to. If the input graph already contains vertices in this domain: - If the ids for this domain are numeric, starts assignment with max id - If the ids for this domain are strings, starts assignment with "group X" where "X" is the max id. Default is "group_vertex".
| virtual char* vtkGroupLeafVertices::GetGroupDomain | ( | ) | [virtual] |
The name of the domain that non-leaf vertices will be assigned to. If the input graph already contains vertices in this domain: - If the ids for this domain are numeric, starts assignment with max id - If the ids for this domain are strings, starts assignment with "group X" where "X" is the max id. Default is "group_vertex".
| int vtkGroupLeafVertices::RequestData | ( | vtkInformation * | request, | |
| vtkInformationVector ** | inputVector, | |||
| vtkInformationVector * | outputVector | |||
| ) | [protected, virtual] |
This is called by the superclass. This is the method you should override.
Reimplemented from vtkTreeAlgorithm.
Member Data Documentation
char* vtkGroupLeafVertices::GroupDomain [protected] |
Definition at line 62 of file vtkGroupLeafVertices.h.
The documentation for this class was generated from the following file:
- dox/Infovis/vtkGroupLeafVertices.h
