| EdgeDistances {TreeTools} | R Documentation |
Distance between edges
Description
Number of nodes that must be traversed to navigate from each edge to each other edge within a tree
Usage
EdgeDistances(tree)
Arguments
tree |
A tree of class |
Value
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.
Author(s)
Martin R. Smith (martin.smith@durham.ac.uk)
See Also
Other tree navigation:
AncestorEdge(),
CladeSizes(),
DescendantEdges(),
EdgeAncestry(),
ListAncestors(),
MRCA(),
MatchEdges(),
NDescendants(),
NodeDepth(),
NodeNumbers(),
NodeOrder(),
RootNode()
Examples
tree <- BalancedTree(5)
plot(tree)
ape::edgelabels()
EdgeDistances(tree)
[Package TreeTools version 1.12.0 Index]