- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 49 for adjacentNodes (0.19 sec)
-
android/guava/src/com/google/common/graph/UndirectedGraphConnections.java
} @Override public Set<N> adjacentNodes() { return Collections.unmodifiableSet(adjacentNodeValues.keySet()); } @Override public Set<N> predecessors() { return adjacentNodes(); } @Override public Set<N> successors() { return adjacentNodes(); } @Override public Iterator<EndpointPair<N>> incidentEdgeIterator(N thisNode) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
} @Override @Test public void adjacentNodes_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); addNode(N1); Set<Integer> adjacentNodes = graph.adjacentNodes(N1); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> adjacentNodes.add(N2)); putEdge(N1, N2); assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); }
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/UndirectedNetworkConnections.java
} static <N, E> UndirectedNetworkConnections<N, E> ofImmutable(Map<E, N> incidentEdges) { return new UndirectedNetworkConnections<>(ImmutableBiMap.copyOf(incidentEdges)); } @Override public Set<N> adjacentNodes() { return Collections.unmodifiableSet(((BiMap<E, N>) incidentEdgeMap).values()); } @Override public Set<E> edgesConnecting(N node) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 1.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
} @Override @Test public void adjacentNodes_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); addNode(N1); Set<Integer> adjacentNodes = graph.adjacentNodes(N1); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> adjacentNodes.add(N2)); putEdge(N1, N2); assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/UndirectedMultiNetworkConnections.java
@Override public Set<N> adjacentNodes() { return Collections.unmodifiableSet(adjacentNodesMultiset().elementSet()); } private Multiset<N> adjacentNodesMultiset() { Multiset<N> adjacentNodes = getReference(adjacentNodesReference); if (adjacentNodes == null) { adjacentNodes = HashMultiset.create(incidentEdgeMap.values());
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
} @Test public void adjacentNodes_oneEdge() { putEdge(N1, N2); assertThat(graph.adjacentNodes(N1)).containsExactly(N2); assertThat(graph.adjacentNodes(N2)).containsExactly(N1); } @Test public void adjacentNodes_noAdjacentNodes() { addNode(N1); assertThat(graph.adjacentNodes(N1)).isEmpty(); } @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingGraph.java
return delegate().nodeOrder(); } @Override public ElementOrder<N> incidentEdgeOrder() { return delegate().incidentEdgeOrder(); } @Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(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/src/com/google/common/graph/ForwardingNetwork.java
return delegate().nodeOrder(); } @Override public ElementOrder<E> edgeOrder() { return delegate().edgeOrder(); } @Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(N node) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
@Override @Test public void adjacentNodes_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); addNode(N1); Set<Integer> adjacentNodes = network.adjacentNodes(N1); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> adjacentNodes.add(N2)); addEdge(N1, N2, E12); assertThat(network.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes);
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) -
guava-tests/test/com/google/common/graph/ValueGraphTest.java
assertThat(graph.allowsSelfLoops()).isEqualTo(asGraph.allowsSelfLoops()); for (Integer node : graph.nodes()) { assertThat(graph.adjacentNodes(node)).isEqualTo(asGraph.adjacentNodes(node)); assertThat(graph.predecessors(node)).isEqualTo(asGraph.predecessors(node)); assertThat(graph.successors(node)).isEqualTo(asGraph.successors(node));
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 18:35:19 GMT 2024 - 20K bytes - Viewed (0)