Struct vtkTree 

pub struct vtkTree(/* private fields */);

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).

@sa vtkDirectedGraph vtkMutableDirectedGraph vtkGraph

Implementations

impl vtkTree

pub fn new() -> Self

Creates a new vtkTree wrapped inside vtkNew

Trait Implementations

impl Default for vtkTree

fn default() -> Self

Returns the “default value” for a type.

impl Drop for vtkTree

fn drop(&mut self)

Executes the destructor for this type.