Last chance! 50% off unlimited learning
Sale ends in
Given a weighted rooted tree tree, PathLengths() returns the distance
from each vertex to each of its descendant vertices.
PathLengths(tree, fullMatrix = FALSE)If fullMatrix = TRUE, PathLengths() returns a square matrix in
which entry [i, j] denotes the distance from internal node i to the
descendant vertex j.
Vertex pairs without a continuous directed path are denoted NA.
If fullMatrix = FALSE, PathLengths() returns a data.frame with three
columns: start lists the deepest node in each path (i.e. that closest
to the root); end lists the shallowest node (i.e. that closest to a leaf);
length lists the total length of that path.
Original tree of class phylo, in Preorder.
Logical specifying return format; see "value" section`.
Other tree properties:
ConsensusWithout(),
MatchEdges(),
NSplits(),
NTip(),
NodeNumbers(),
SplitsInBinaryTree(),
TipLabels(),
TreeIsRooted()
tree <- rtree(6)
plot(tree)
add.scale.bar()
nodelabels()
tiplabels()
PathLengths(tree)
Run the code above in your browser using DataLab