creates and returns an iterator that traverses the subtree rooted at this node in breadth-first order . the first node returned by iterator #next is this node . modifying the tree by inserting , removing , or moving a node invalidates any iterators created before the modification . concode_field_sep Queue<Iterator<DependencyNode>> queue concode_elem_sep Iterator<DependencyNode> subtree concode_elem_sep Iterator<DependencyNode> children concode_elem_sep DependencyNode root concode_elem_sep String FORGE_ADDON_CLASSIFIER concode_elem_sep Stack<Iterator<DependencyNode>> stack concode_field_sep DependencyNode next concode_elem_sep DependencyNode next concode_elem_sep DependencyNode next concode_elem_sep List<T> select concode_elem_sep List<DependencyNode> select concode_elem_sep CharSequence prettyPrint concode_elem_sep String prettyPrint concode_elem_sep void prettyPrint concode_elem_sep T selectFirst concode_elem_sep Iterator<DependencyNode> preorderIterator concode_elem_sep boolean hasNext concode_elem_sep boolean hasNext concode_elem_sep boolean hasNext concode_elem_sep void selectInternal concode_elem_sep Iterator<DependencyNode> depthFirstIterator concode_elem_sep boolean isForgeAddon concode_elem_sep void remove concode_elem_sep void remove concode_elem_sep void remove
Iterator < DependencyNode > function ( DependencyNode arg0 ) { return new BreadthFirstIterator ( arg0 ) ; }