VTK
|
A rooted tree data structure. More...
#include <vtkTree.h>
Public Types | |
typedef vtkDirectedAcyclicGraph | Superclass |
![]() | |
typedef vtkDirectedGraph | Superclass |
![]() | |
typedef vtkGraph | Superclass |
![]() | |
typedef vtkDataObject | Superclass |
![]() | |
typedef vtkObject | Superclass |
enum | FieldAssociations { FIELD_ASSOCIATION_POINTS, FIELD_ASSOCIATION_CELLS, FIELD_ASSOCIATION_NONE, FIELD_ASSOCIATION_POINTS_THEN_CELLS, FIELD_ASSOCIATION_VERTICES, FIELD_ASSOCIATION_EDGES, FIELD_ASSOCIATION_ROWS, NUMBER_OF_ASSOCIATIONS } |
enum | AttributeTypes { POINT, CELL, FIELD, POINT_THEN_CELL, VERTEX, EDGE, ROW, NUMBER_OF_ATTRIBUTE_TYPES } |
enum | FieldOperations { FIELD_OPERATION_PRESERVED, FIELD_OPERATION_REINTERPOLATED, FIELD_OPERATION_MODIFIED, FIELD_OPERATION_REMOVED } |
![]() | |
typedef vtkObjectBase | Superclass |
Public Member Functions | |
virtual const char * | GetClassName () |
virtual int | IsA (const char *type) |
void | PrintSelf (ostream &os, vtkIndent indent) |
virtual int | GetDataObjectType () |
vtkIdType | GetChild (vtkIdType v, vtkIdType i) |
vtkIdType | GetParent (vtkIdType v) |
vtkIdType | GetLevel (vtkIdType v) |
bool | IsLeaf (vtkIdType vertex) |
virtual void | ReorderChildren (vtkIdType parent, vtkIdTypeArray *children) |
virtual vtkIdType | GetRoot () |
vtkIdType | GetNumberOfChildren (vtkIdType v) |
void | GetChildren (vtkIdType v, vtkAdjacentVertexIterator *it) |
vtkEdgeType | GetParentEdge (vtkIdType v) |
Protected Member Functions | |
vtkTree () | |
~vtkTree () | |
virtual bool | IsStructureValid (vtkGraph *g) |
![]() | |
vtkDirectedAcyclicGraph () | |
~vtkDirectedAcyclicGraph () | |
![]() | |
vtkDirectedGraph () | |
~vtkDirectedGraph () | |
![]() | |
vtkGraph () | |
~vtkGraph () | |
void | AddVertexInternal (const vtkVariant &pedigree, vtkIdType *vertex) |
void | RemoveVertexInternal (vtkIdType v, bool directed) |
void | RemoveEdgeInternal (vtkIdType e, bool directed) |
void | RemoveVerticesInternal (vtkIdTypeArray *arr, bool directed) |
virtual void | CopyInternal (vtkGraph *g, bool deep) |
void | SetInternals (vtkGraphInternals *internals) |
void | SetEdgePoints (vtkGraphEdgePoints *edgePoints) |
void | ForceOwnership () |
void | BuildEdgeList () |
void | AddVertexInternal (vtkVariantArray *propertyArr=0, vtkIdType *vertex=0) |
void | AddEdgeInternal (vtkIdType u, vtkIdType v, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge) |
void | AddEdgeInternal (const vtkVariant &uPedigree, vtkIdType v, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge) |
void | AddEdgeInternal (vtkIdType u, const vtkVariant &vPedigree, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge) |
void | AddEdgeInternal (const vtkVariant &uPedigree, const vtkVariant &vPedigree, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge) |
void | RemoveEdgesInternal (vtkIdTypeArray *arr, bool directed) |
virtual void | GetOutEdges (vtkIdType v, const vtkOutEdgeType *&edges, vtkIdType &nedges) |
virtual void | GetInEdges (vtkIdType v, const vtkInEdgeType *&edges, vtkIdType &nedges) |
virtual vtkIdTypeArray * | GetEdgeList () |
virtual void | SetEdgeList (vtkIdTypeArray *list) |
![]() | |
vtkDataObject () | |
~vtkDataObject () | |
vtkExecutive * | GetExecutive () |
int | GetPortNumber () |
virtual void | ReportReferences (vtkGarbageCollector *) |
vtkStreamingDemandDrivenPipeline * | TrySDDP (const char *method) |
![]() | |
vtkObject () | |
virtual | ~vtkObject () |
virtual void | RegisterInternal (vtkObjectBase *, int check) |
virtual void | UnRegisterInternal (vtkObjectBase *, int check) |
void | InternalGrabFocus (vtkCommand *mouseEvents, vtkCommand *keypressEvents=NULL) |
void | InternalReleaseFocus () |
![]() | |
vtkObjectBase () | |
virtual | ~vtkObjectBase () |
virtual void | CollectRevisions (ostream &os) |
vtkObjectBase (const vtkObjectBase &) | |
void | operator= (const vtkObjectBase &) |
Protected Attributes | |
vtkIdType | Root |
Additional Inherited Members | |
![]() | |
typedef vtkStreamingDemandDrivenPipeline | SDDP |
![]() | |
static double | DefaultPoint [3] |
![]() | |
static const char | AssociationNames [NUMBER_OF_ASSOCIATIONS][55] |
A rooted tree data structure.
vtkTree is a connected directed graph with no cycles. A tree is a type of directed graph, so works with all graph algorithms.
vtkTree is a read-only data structure. To construct a tree, create an instance of vtkMutableDirectedGraph. Add vertices and edges with AddVertex() and AddEdge(). You may alternately start by adding a single vertex as the root then call graph->AddChild(parent) which adds a new vertex and connects the parent to the child. The tree MUST have all edges in the proper direction, from parent to child. After building the tree, call tree->CheckedShallowCopy(graph) to copy the structure into a vtkTree. This method will return false if the graph is an invalid tree.
vtkTree provides some convenience methods for obtaining the parent and children of a vertex, for finding the root, and determining if a vertex is a leaf (a vertex with no children).
|
protected |
|
protected |
|
static |
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
Reimplemented from vtkDirectedAcyclicGraph.
|
virtual |
Reimplemented from vtkDirectedAcyclicGraph.
|
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 vtkDirectedAcyclicGraph.
|
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 vtkDirectedAcyclicGraph.
Reimplemented from vtkDirectedAcyclicGraph.
|
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 vtkDirectedAcyclicGraph.
|
inlinevirtual |
Return what type of dataset this is.
Reimplemented from vtkDirectedAcyclicGraph.
|
virtual |
Get the root vertex of the tree.
|
inline |
vtkEdgeType vtkTree::GetParentEdge | ( | vtkIdType | v | ) |
Get the edge connecting the vertex to its parent.
Get the level of the vertex in the tree. The root vertex has level 0. Returns -1 if the vertex id is < 0 or greater than the number of vertices in the tree.
bool vtkTree::IsLeaf | ( | vtkIdType | vertex | ) |
Return whether the vertex is a leaf (i.e. it has no children).
|
static |
Retrieve a graph from an information vector.
Reimplemented from vtkDirectedAcyclicGraph.
|
static |
Retrieve a graph from an information vector.
Reimplemented from vtkDirectedAcyclicGraph.
|
virtual |
Reorder the children of a parent vertex. The children array must contain all the children of parent, just in a different order. This does not change the topology of the tree.
|
protectedvirtual |
Check the storage, and accept it if it is a valid tree.
Reimplemented from vtkDirectedAcyclicGraph.