Distance between edges
Number of nodes that must be traversed to navigate from each edge to each other edge within a tree
EdgeDistances(tree)
tree |
A tree of class |
EdgeDistances() returns a symmetrical matrix listing the number
of edges that must be traversed to travel from each numbered edge to each
other.
The two edges straddling the root of a rooted tree
are treated as a single edge. Add a 'root' tip using AddTip() if the
position of the root is significant.
Martin R. Smith (martin.smith@durham.ac.uk)
Other tree navigation:
AncestorEdge(),
CladeSizes(),
DescendantEdges(),
EdgeAncestry(),
ListAncestors(),
MRCA(),
NDescendants(),
NodeDepth(),
NodeOrder(),
NonDuplicateRoot(),
RootNode()
tree <- BalancedTree(5) plot(tree) ape::edgelabels() EdgeDistances(tree)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.