A rooted tree data structure. More...
#include <vtkDirectedAcyclicGraph.h>
Public Types | |
| typedef vtkDirectedGraph | Superclass |
Public Member Functions | |
| virtual int | IsA (const char *type) |
| vtkDirectedAcyclicGraph * | NewInstance () const |
| void | PrintSelf (ostream &os, vtkIndent indent) |
| virtual int | GetDataObjectType () |
Static Public Member Functions | |
| static vtkDirectedAcyclicGraph * | New () |
| static int | IsTypeOf (const char *type) |
| static vtkDirectedAcyclicGraph * | SafeDownCast (vtkObjectBase *o) |
| static vtkDirectedAcyclicGraph * | GetData (vtkInformation *info) |
| static vtkDirectedAcyclicGraph * | GetData (vtkInformationVector *v, int i=0) |
Protected Member Functions | |
| virtual vtkObjectBase * | NewInstanceInternal () const |
| vtkDirectedAcyclicGraph () | |
| ~vtkDirectedAcyclicGraph () | |
| virtual bool | IsStructureValid (vtkGraph *g) |
Detailed Description
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 56 of file vtkDirectedAcyclicGraph.h.
Member Typedef Documentation
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
Definition at line 60 of file vtkDirectedAcyclicGraph.h.
Constructor & Destructor Documentation
| vtkDirectedAcyclicGraph::vtkDirectedAcyclicGraph | ( | ) | [protected] |
| vtkDirectedAcyclicGraph::~vtkDirectedAcyclicGraph | ( | ) | [protected] |
Member Function Documentation
| static vtkDirectedAcyclicGraph* vtkDirectedAcyclicGraph::New | ( | ) | [static] |
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
| static int vtkDirectedAcyclicGraph::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 vtkDirectedGraph.
Reimplemented in vtkTree.
| virtual int vtkDirectedAcyclicGraph::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 vtkDirectedGraph.
Reimplemented in vtkTree.
| static vtkDirectedAcyclicGraph* vtkDirectedAcyclicGraph::SafeDownCast | ( | vtkObjectBase * | o | ) | [static] |
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
| virtual vtkObjectBase* vtkDirectedAcyclicGraph::NewInstanceInternal | ( | ) | const [protected, virtual] |
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
| void vtkDirectedAcyclicGraph::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 vtkDirectedGraph.
Reimplemented in vtkTree.
| virtual int vtkDirectedAcyclicGraph::GetDataObjectType | ( | ) | [inline, virtual] |
Return what type of dataset this is.
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
Definition at line 64 of file vtkDirectedAcyclicGraph.h.
| static vtkDirectedAcyclicGraph* vtkDirectedAcyclicGraph::GetData | ( | vtkInformation * | info | ) | [static] |
Retrieve a graph from an information vector.
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
| static vtkDirectedAcyclicGraph* vtkDirectedAcyclicGraph::GetData | ( | vtkInformationVector * | v, |
| int | i = 0 |
||
| ) | [static] |
Retrieve a graph from an information vector.
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
| virtual bool vtkDirectedAcyclicGraph::IsStructureValid | ( | vtkGraph * | g | ) | [protected, virtual] |
Check the storage, and accept it if it is a valid tree.
Reimplemented from vtkDirectedGraph.
Reimplemented in vtkTree.
The documentation for this class was generated from the following file:
- dox/Common/DataModel/vtkDirectedAcyclicGraph.h
