- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for forGraph (0.18 sec)
-
guava-tests/test/com/google/common/graph/TraverserTest.java
} @Test public void forGraph_breadthFirstIterable_twoTrees() { assertEqualCharNodes(Traverser.forGraph(TWO_TREES).breadthFirst(charactersOf("a")), "ab"); assertEqualCharNodes(Traverser.forGraph(TWO_TREES).breadthFirst(charactersOf("ac")), "acbd"); } @Test public void forGraph_breadthFirst_singleRoot() { Iterable<Character> result = Traverser.forGraph(SINGLE_ROOT).breadthFirst('a');
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
} @Test public void forGraph_breadthFirstIterable_twoTrees() { assertEqualCharNodes(Traverser.forGraph(TWO_TREES).breadthFirst(charactersOf("a")), "ab"); assertEqualCharNodes(Traverser.forGraph(TWO_TREES).breadthFirst(charactersOf("ac")), "acbd"); } @Test public void forGraph_breadthFirst_singleRoot() { Iterable<Character> result = Traverser.forGraph(SINGLE_ROOT).breadthFirst('a');
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* <li>(1) "no" and (2) "no", use {@link #forGraph(SuccessorsFunction)}. * <li>(1) "yes" and (2) "yes", use {@link #forTree(SuccessorsFunction)}. * <li>(1) "yes" and (2) "no", you can use either, but {@code forTree()} will be more efficient. * <li>(1) "no" and (2) "yes", <b><i>neither will work</i></b>, but if you transform your node * objects into a non-recursive form, you can use {@code forGraph()}. * </ul> * * @author Jens Nyman
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
*/ public static <N> ImmutableSet<N> reachableNodes(Graph<N> graph, N node) { checkArgument(graph.nodes().contains(node), NODE_NOT_IN_GRAPH, node); return ImmutableSet.copyOf(Traverser.forGraph(graph).breadthFirst(node)); } // Graph mutation methods // Graph view methods /** * Returns a view of {@code graph} with the direction (if any) of every edge reversed. All other
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0)