Searched refs:forTree (Results 1 – 11 of 11) sorted by relevance
730 Traverser.forTree(graph); // Does not throw in forTree_acceptsDirectedGraph()739 Traverser.forTree(graph); in forTree_withUndirectedGraph_throws()751 Traverser.forTree(valueGraph); // Does not throw in forTree_acceptsDirectedValueGraph()760 Traverser.forTree(valueGraph); in forTree_withUndirectedValueGraph_throws()772 Traverser.forTree(network); // Does not throw in forTree_acceptsDirectedNetwork()781 Traverser.forTree(network); in forTree_withUndirectedNetwork_throws()789 Traverser<Character> traverser = Traverser.forTree(TREE); in forTree_breadthFirst_tree()798 Traverser<Character> traverser = Traverser.forTree(TREE); in forTree_breadthFirstIterable_tree()808 Traverser<Character> traverser = Traverser.forTree(CYCLIC_GRAPH_CONTAINING_TREE); in forTree_breadthFirst_cyclicGraphContainingTree()817 Traverser<Character> traverser = Traverser.forTree(CYCLIC_GRAPH_CONTAINING_TREE); in forTree_breadthFirstIterable_cyclicGraphContainingTree()[all …]
49 return Traverser.forTree((N node) -> getChildren(node)).depthFirstPreOrder(root); in after()74 return Traverser.forTree((N node) -> getChildren(node)).depthFirstPostOrder(root);99 return Traverser.forTree((N node) -> getChildren(node)).breadthFirst(root);
145 Traverser.forTree(BindingGraph::subgraphs);
63 Traverser.forTree(ValidationReport::subreports);
85 Traverser.forTree(Element::getEnclosedElements);
169 public static <N> Traverser<N> forTree(SuccessorsFunction<N> tree) { in forTree() method in Traverser
869 return Traverser.forTree(FILE_TREE); in fileTraverser()
292 return Traverser.forTree(FILE_TREE);