Set < Node < E >> function ( ) { return ( children ) ; }
returns the children concode_field_sep SortedSet<Node<E>> children concode_elem_sep E label concode_elem_sep Map<E,Node<E>> nodes concode_elem_sep SortedSet<Node<E>> parents concode_field_sep void addParent concode_elem_sep void makeClosure concode_elem_sep int compareTo concode_elem_sep E label concode_elem_sep Node<E> getOrMake concode_elem_sep SortedSet<Node<E>> roots concode_elem_sep Set<Node<E>> descendants concode_elem_sep void descendants concode_elem_sep Collection<E> labels concode_elem_sep int numNodes concode_elem_sep boolean contains concode_elem_sep Collection<Node<E>> nodes concode_elem_sep SortedSet<Node<E>> leaves concode_elem_sep int hashCode concode_elem_sep boolean equals concode_elem_sep Node<E> get concode_elem_sep Set<Node<E>> links concode_elem_sep String toString concode_elem_sep String toString concode_elem_sep SortedSet<Node<E>> ancestors concode_elem_sep void ancestors concode_elem_sep void addChild concode_elem_sep void addLink concode_elem_sep void addLink concode_elem_sep void closure concode_elem_sep Set<Node<E>> parents