- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 560 for successor (0.17 sec)
-
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
} @Override @Test public void successors_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); addNode(N1); Set<Integer> successors = graph.successors(N1); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> successors.add(N2)); putEdge(N1, N2); assertThat(graph.successors(N1)).containsExactlyElementsIn(successors); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
return graph; } @Override public Set<N> predecessors(N node) { return delegate().successors(node); // transpose } @Override public Set<N> successors(N node) { return delegate().predecessors(node); // transpose } @Override public Set<EndpointPair<N>> incidentEdges(N node) { return new IncidentEdgeSet<N>(this, node) {
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) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public Set<N> predecessors(N node) { return AbstractNetwork.this.predecessors(node); } @Override public Set<N> successors(N node) { return AbstractNetwork.this.successors(node); } // DO NOT override the AbstractGraph *degree() implementations. }; } @Override public int degree(N node) { if (isDirected()) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
} @Override @Test public void successors_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); addNode(N1); Set<Integer> successors = graph.successors(N1); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> successors.add(N2)); putEdge(N1, N2); assertThat(successors).containsExactlyElementsIn(graph.successors(N1)); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
} @Override @Test public void successors_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); addNode(N1); Set<Integer> successors = graph.successors(N1); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> successors.add(N2)); putEdge(N1, N2); assertThat(graph.successors(N1)).containsExactlyElementsIn(successors); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingGraph.java
return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @Override public Set<EndpointPair<N>> incidentEdges(N node) { return delegate().incidentEdges(node); } @Override public int degree(N node) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
} @Override @Test public void successors_checkReturnedSetMutability() { addNode(N1); Set<Integer> successors = network.successors(N1); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> successors.add(N2)); addEdge(N1, N2, E12); assertThat(network.successors(N1)).containsExactlyElementsIn(successors); } @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractValueGraph.java
} @Override public Set<N> predecessors(N node) { return AbstractValueGraph.this.predecessors(node); } @Override public Set<N> successors(N node) { return AbstractValueGraph.this.successors(node); } @Override public int degree(N node) { return AbstractValueGraph.this.degree(node); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 17 13:59:28 GMT 2023 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
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-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
} @Override @Test public void successors_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); addNode(N1); Set<Integer> successors = network.successors(N1); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> successors.add(N2)); addEdge(N1, N2, E12); assertThat(successors).containsExactlyElementsIn(network.successors(N1)); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.2K bytes - Viewed (0)