Method getInternalEdges

src/figtree/treeviewer/ReRootedTree.java:475–483

The set of internal edges. This is a pretty inefficient implementation because a new set is constructed each time this is called. @return the set of internal edges.

()

     * @return the set of internal edges.
     */
    public Set<Edge> getInternalEdges() {
        Set<Edge> edges = new LinkedHashSet<Edge>();
        for (Node node : getInternalNodes()) {
            if (node != getRootNode()) {
                edges.add(((ReRootedNode)node).getEdge());
            }
        }
        return edges;
    }

    /**
     * @param degree the number of edges connected to a node