public interface RootedTree extends Tree
Graph.NoEdgeException, Graph.Utils
Modifier and Type | Method and Description |
---|---|
boolean |
conceptuallyUnrooted()
Due to current implementation limitations, trees store "branch" information in nodes.
|
java.util.List<Node> |
getChildren(Node node) |
double |
getHeight(Node node) |
double |
getLength(Node node) |
Node |
getParent(Node node) |
Node |
getRootNode()
The root of the tree has the largest node height of
all nodes in the tree.
|
boolean |
hasHeights() |
boolean |
hasLengths() |
boolean |
isRoot(Node node) |
getExternalEdges, getExternalNodes, getInternalEdges, getInternalNodes, getNode, getTaxa, getTaxon, isExternal, renameTaxa
getAdjacencies, getEdge, getEdgeLength, getEdges, getEdges, getNodes, getNodes, getNodes
getAttribute, getAttributeMap, getAttributeNames, removeAttribute, setAttribute
java.util.List<Node> getChildren(Node node)
node
- the node whose children are being requested.boolean hasHeights()
double getHeight(Node node)
node
- the node whose height is being requested.boolean hasLengths()
double getLength(Node node)
node
- the node whose branch length (to its parent) is being requested.Node getParent(Node node)
node
- the node whose parent is requestedNode getRootNode()
boolean conceptuallyUnrooted()
boolean isRoot(Node node)
node
- the nodehttp://code.google.com/p/jebl2/