Climb a tree from parent to children, by provided criteria.
Determine the number a Node
has after conversion to a phylo object
Convert a dendrogram
to a data.tree Node
Check if a Node
is a leaf
data.tree: Hierarchical Data Structures
Prunes a tree.
Convert a nested list
structure to a data.tree
structure
NODE_RESERVED_NAMES_CONST
Names that are reserved by the Node class.
Reverts the sort order of a Node
's children.
Navigate to another node by relative path.
Create a data.tree
Structure With Nodes
Convert a a party
from the partykit package to a data.tree
structure.
Traverse a Tree and Collect Values
Get an attribute from a Node.
Format a Number as a Percentage
Format a Number as a Decimal
Traverse a Tree and Assign Values
Set a formatter function on a specific node
Convert a data.tree
structure to a data.frame
Convert a Node
to a dendrogram
Executes a function on a set of nodes
Convert a phylo
object from the ape package to a Node
Sample Data: A Simple Company with Departments
Find a node by name in the (sub-)tree
Plot a graph, or get a graphviz dot representation of the tree
Convert a data.tree
structure to an igraph network
Write a data.tree
structure to Newick notation
Sort children of a Node
or an entire data.tree
structure
Print a Node
in a human-readable fashion.
Convert a Node
to a phylo object from the ape package.
Calculate the average number of branches each non-leaf has
Traverse a tree or a sub-tree
Convert an object to a data.tree
data structure
Convert a data.tree
structure to a list-of-list structure
Convert a data.frame
to a data.tree
structure
Convert a a SplitNode
from the party package to a data.tree
structure.
Check if a Node
is not a leaf
Check if a Node
is not a root
Check if a Node
is the root
Sample Data: Data Used by the ID3 Vignette
Create a tree for demo and testing
Create a tree for demo and testing
Calculates the height of a Node
given the height of the root.
Cumulate values among siblings
Aggregate child values of a Node
, recursively.
Test whether all node names are unique.
Clone a tree (creates a deep copy)
Find the distance between two nodes of the same tree
Checks whether name
is a reserved word, as defined in NODE_RESERVED_NAMES_CONST
.