76 vtkGetMacro(Root, vtkIdType);
88 vtkIdType GetChild(vtkIdType v, vtkIdType i);
101 vtkIdType GetParent(vtkIdType v);
113 vtkIdType GetLevel(vtkIdType v);
118 bool IsLeaf(vtkIdType vertex);
134 virtual void ReorderChildren(vtkIdType parent,
vtkIdTypeArray *children);
153 void operator=(
const vtkTree&) =
delete;
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
vtkIdType GetNumberOfChildren(vtkIdType v)
Get the number of children of a vertex.
Iterates through adjacent vertices in a graph.
static vtkDirectedAcyclicGraph * New()
dynamic, self-adjusting array of vtkIdType
virtual void GetAdjacentVertices(vtkIdType v, vtkAdjacentVertexIterator *it)
Initializes the adjacent vertex iterator to iterate over all outgoing vertices from vertex v.
Base class for graph data types.
a simple class to control print indentation
int GetDataObjectType() override
Return what type of dataset this is.
vtkIdType Root
The root of the tree.
static vtkDirectedAcyclicGraph * GetData(vtkInformation *info)
Retrieve a graph from an information vector.
bool IsStructureValid(vtkGraph *g) override
Check the storage, and accept it if it is a valid tree.
void GetChildren(vtkIdType v, vtkAdjacentVertexIterator *it)
Get the child vertices of a vertex.
A rooted tree data structure.
A rooted tree data structure.
#define VTKCOMMONDATAMODEL_EXPORT
virtual vtkIdType GetOutDegree(vtkIdType v)
The number of outgoing edges from vertex v.