Find a node by name.
The first call to find will cache all nodes in the tree on the assumption that additional calls to find will be made.
find will first attempt to find the node in the tips. If it cannot find a corresponding tip, then it will search through the internal nodes of the tree. In practice, phylogenetic trees and other common trees in biology do not have unique internal node names. As a result, this find method will only return the first occurance of an internal node encountered on a postorder traversal of the tree.
Parameters: | name : TreeNode or str
|
---|---|
Returns: | TreeNode
|
Raises: | MissingNodeError
|
See also
Examples
>>> from six import StringIO
>>> from skbio import TreeNode
>>> tree = TreeNode.read(StringIO("((a,b)c,(d,e)f);"))
>>> print(tree.find('c').name)
c