Last chance! 50% off unlimited learning
Sale ends in
fWidths(nodeDists)
fAvgLadder(ladderNumbers)
fNLadders(ladderNumbers)
fColless(treeImbalance)
fNConfig(nTipDes,configSize)
dists
on a tree. That is, a vector organised by nodeId
giving the distance of each node from the root.ladderNums
on a tree. That is, a vector organised by nodeId
giving the largest ladder size going away from the root starting from each node.treeImb
on a tree. See treeImb
for more information.nTipDescendants
on a tree. That is, a vector organised by nodeId
giving the number of tip descendants of each node.fColless
corresponds to colless
. These functions are much faster but take inputs which already require a reasonable amount of work to calculate. To learn more about fColless
see the documentation for colless
.
For example, the intention is that when calculating many topological properties it may be faster to calculate ladderNumbers
and nodeDists
first and then run these functions.fastModelAnalysis
for more deatiled examples.## Sets up an example tree
tree <- rtree4(50)
## This returns the same ouput as avgLadder(tree)
ladderNumbers <- ladderNums(tree)
fAvgLadder(ladderNumbers)
## But now we can calculate the number of ladders more efficiently.
fNLadders
Run the code above in your browser using DataLab