Public

<init>

Returns the number of children of this node.

childCount

Returns a depth first Iterable. This enables iterating the subtree rooted at
this node in post order

depthFirstIterator

The label of this node. If the label is not set, this looks for a label property
TreeNodeProperties#

getLabel

getParent

isInnerNode

isLeaf

Returns an Iterable over all children of this node. This allow using nodes in
foreach loop: 
for(Tre

children

Get a list of all children of this node. It is helpful if one wants to iterate
over all children and

getChildren

Return the edge to the parent node or null.

getEdgeToParent

Lazy and one time computation of the level of this node.

getLevel

Returns the distance to the parent node. If the node has no parent (root node )
-1 is returned.

getDistanceToParent

Returns the leaves under this node in depths first traversal order.

getLeaves

setLabel

cloneNode

Compares this TreeNode with a given object. If the nodes are in the same Tree,
then their indes is c

equalsNode

getChildAt

getGraph

getIndex

Creates and returns the Partition of this node. Partitions are not cached and
recomputed for each ca

getPartition

StringBuilder

Making http post requests using okhttp

Signals that an I/O exception of some sort has occurred. This class is the
general class of exceptio

java.io.IOException

This class represents an Internet Protocol (IP) address. An IP address is either
a 32-bit or 128-bit

java.net.InetAddress

A connection represents a link from a Java application to a database. All SQL
statements and results

java.sql.Connection

A Red-Black tree based NavigableMap implementation. The map is sorted according
to the Comparable of

java.util.TreeMap

javax.imageio.ImageIO

scala.Option

setContentView

getContentResolver

onRequestPermissionsResult

// insert a new edge between lca and its parent

// check if the subtree consists of just one leaf

/* else {
                                    System.out.println("no ! not nhx");
                                    label.append("[");
                                }*/

/* else {
                                    label.append("]");
                                }*/

/**
     * Deletes the specified node from the tree.The child of this node becomes child
     * of its parent.
     * If the node has more than one child, nothing have to be done.
     *
     * @param node:         the node, that has to be deleted
     * @param tree:         the tree, from that the tree has to be deleted
     * @param sumEdgeWeight sum up edge weight of the pruned edge
     */

//prune the node, if it has only one child

//otherwise, do nothing (node can't be pruned)

How to use getChildAtmethodin phylo.tree.model.TreeNode

Best Java code snippets using phylo.tree.model.TreeNode.getChildAt (Showing top 4 results out of 315)

How to use
getChildAt
method
in
phylo.tree.model.TreeNode