Method getExternalEdges

src/figtree/treeviewer/ReRootedTree.java:462–468

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

()

     * @return the set of external edges.
     */
    public Set<Edge> getExternalEdges() {
        Set<Edge> edges = new LinkedHashSet<Edge>();
        for (Node node : getExternalNodes()) {
            edges.add(((ReRootedNode)node).getEdge());
        }
        return edges;
    }

    /**
     * The set of internal edges. This is a pretty inefficient implementation because