Skip navigation links
A B D E F G H I N O P R S T U Y 

T

toNewick() - Method in class net.junaraki.libtree.OrderedTree
Returns a string representation of this tree in the Newick standard format.
toNewick(String, String) - Method in class net.junaraki.libtree.OrderedTree
Returns a string representation of this tree in the Newick standard format with the given starting and ending mark.
toNewick() - Method in class net.junaraki.libtree.UnorderedTree
Returns a string representation of this tree in the Newick standard format.
toNewick(String, String) - Method in class net.junaraki.libtree.UnorderedTree
Returns a string representation of this tree in the Newick standard format with the given starting and ending mark.
toString() - Method in class net.junaraki.libtree.OrderedTree
Returns a string representation of this tree in the format of the UNIX 'tree' command.
toString() - Method in class net.junaraki.libtree.UnorderedTree
Returns a string representation of this tree in the format of the UNIX 'tree' command.
traverse() - Method in class net.junaraki.libtree.OrderedTree
Traverses this tree, and returns a list of found elements in this tree.
traverseLevelOrder() - Method in class net.junaraki.libtree.OrderedTree
Traverses this tree in the level-order manner, which is breadth-first search (BFS), and returns a list of found elements.
traverseNodes() - Method in class net.junaraki.libtree.OrderedTree
Traverses this tree, and returns a list of found nodes in this tree.
traverseNodesLevelOrder() - Method in class net.junaraki.libtree.OrderedTree
Traverses this tree in the level-order manner, which is breadth-first search (BFS), and returns a list of found nodes.
traverseNodesPostOrder() - Method in class net.junaraki.libtree.OrderedTree
Traverses this tree in the post-order manner, which is one way of depth-first search (DFS), and returns a list of found nodes.
traverseNodesPreOrder() - Method in class net.junaraki.libtree.OrderedTree
Traverses this tree in the pre-order manner, which is one way of depth-first search (DFS), and returns a list of found nodes.
traversePostOrder() - Method in class net.junaraki.libtree.OrderedTree
Traverses this tree in the post-order manner, which is one way of depth-first search (DFS), and returns a list of found elements.
traversePreOrder() - Method in class net.junaraki.libtree.OrderedTree
Traverses this tree in the pre-order manner, which is one way of depth-first search (DFS), and returns a list of found elements.
Tree<E> - Interface in net.junaraki.libtree
An interface for a general-purpose tree and a node.
A B D E F G H I N O P R S T U Y 
Skip navigation links