VTK
|
A rooted tree data structure. More...
#include <vtkDirectedAcyclicGraph.h>
Public Types | |
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 () |
Protected Member Functions | |
vtkDirectedAcyclicGraph () | |
~vtkDirectedAcyclicGraph () | |
virtual bool | IsStructureValid (vtkGraph *g) |
![]() | |
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 &) |
Additional Inherited Members | |
![]() | |
typedef vtkStreamingDemandDrivenPipeline | SDDP |
![]() | |
vtkGraphInternals * | Internals |
vtkDistributedGraphHelper * | DistributedHelper |
vtkGraphEdgePoints * | EdgePoints |
double | Bounds [6] |
vtkTimeStamp | ComputeTime |
vtkDataSetAttributes * | VertexData |
vtkDataSetAttributes * | EdgeData |
vtkPoints * | Points |
vtkIdTypeArray * | EdgeList |
![]() | |
static double | DefaultPoint [3] |
![]() | |
static const char | AssociationNames [NUMBER_OF_ASSOCIATIONS][55] |
A rooted tree data structure.
vtkDirectedAcyclicGraph is a connected directed graph with no cycles. A tree is a type of directed graph, so works with all graph algorithms.
vtkDirectedAcyclicGraph 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 vtkDirectedAcyclicGraph. This method will return false if the graph is an invalid tree.
vtkDirectedAcyclicGraph 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).
Definition at line 55 of file vtkDirectedAcyclicGraph.h.
Definition at line 59 of file vtkDirectedAcyclicGraph.h.
|
protected |
|
protected |
|
static |
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
|
virtual |
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
|
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 vtkDirectedGraph.
Reimplemented in vtkTree.
|
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 vtkDirectedGraph.
Reimplemented in vtkTree.
|
static |
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
|
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 vtkDirectedGraph.
Reimplemented in vtkTree.
|
inlinevirtual |
Return what type of dataset this is.
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
Definition at line 63 of file vtkDirectedAcyclicGraph.h.
|
static |
Retrieve a graph from an information vector.
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
|
static |
Retrieve a graph from an information vector.
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
|
protectedvirtual |
Check the storage, and accept it if it is a valid tree.
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.