- Sort Score
- Result 10 results
- Languages All
Results 21 - 27 of 27 for OutEdge (0.08 sec)
-
android/guava-tests/test/com/google/common/graph/StandardImmutableGraphAdditionalTest.java
GraphBuilder.directed().<String>immutable().putEdge("A", "B").build(); assertThat(graph.nodes()).containsExactly("A", "B"); assertThat(graph.edges()).containsExactly(EndpointPair.ordered("A", "B")); } @Test public void immutableGraphBuilder_putEdgeFromEndpointPair() { ImmutableGraph<String> graph = GraphBuilder.directed().<String>immutable().putEdge(EndpointPair.ordered("A", "B")).build();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Jan 09 20:24:43 UTC 2020 - 4.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/StandardImmutableGraphAdditionalTest.java
GraphBuilder.directed().<String>immutable().putEdge("A", "B").build(); assertThat(graph.nodes()).containsExactly("A", "B"); assertThat(graph.edges()).containsExactly(EndpointPair.ordered("A", "B")); } @Test public void immutableGraphBuilder_putEdgeFromEndpointPair() { ImmutableGraph<String> graph = GraphBuilder.directed().<String>immutable().putEdge(EndpointPair.ordered("A", "B")).build();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Jan 09 20:24:43 UTC 2020 - 4.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
graph.addNode(gen.nextInt(NODE_POOL_SIZE)); } ArrayList<Integer> nodeList = new ArrayList<>(graph.nodes()); while (graph.edges().size() < NUM_EDGES) { graph.putEdge(getRandomElement(nodeList, gen), getRandomElement(nodeList, gen)); } ArrayList<EndpointPair<Integer>> edgeList = new ArrayList<>(graph.edges()); assertThat(graph.nodes()).hasSize(NUM_NODES);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Aug 18 16:17:46 UTC 2017 - 4.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
// will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it. if (graph.isDirected()) { // Note: works for both directed and undirected graphs, but we only use in the directed case. for (N node : graph.nodes()) { for (N reachableNode : reachableNodes(graph, node)) { transitiveClosure.putEdge(node, reachableNode); } } } else {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
// will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it. if (graph.isDirected()) { // Note: works for both directed and undirected graphs, but we only use in the directed case. for (N node : graph.nodes()) { for (N reachableNode : reachableNodes(graph, node)) { transitiveClosure.putEdge(node, reachableNode); } } } else {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
MutableGraph<String> graph = GraphBuilder.directed().build(); graph.putEdge("a", "b"); Traverser.forTree(graph); // Does not throw } @Test public void forTree_withUndirectedGraph_throws() throws Exception { MutableGraph<String> graph = GraphBuilder.undirected().build(); graph.putEdge("a", "b"); assertThrows(IllegalArgumentException.class, () -> Traverser.forTree(graph));
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 47.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
MutableGraph<String> graph = GraphBuilder.directed().build(); graph.putEdge("a", "b"); Traverser.forTree(graph); // Does not throw } @Test public void forTree_withUndirectedGraph_throws() throws Exception { MutableGraph<String> graph = GraphBuilder.undirected().build(); graph.putEdge("a", "b"); assertThrows(IllegalArgumentException.class, () -> Traverser.forTree(graph));
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 47.5K bytes - Viewed (0)