- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for edgesConnecting (0.17 sec)
-
guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
} @Test public void edgesConnecting_parallelEdges_undirected() { assume().that(network.allowsParallelEdges()).isTrue(); assume().that(network.isDirected()).isFalse(); addEdge(N1, N2, E12); addEdge(N1, N2, E12_A); addEdge(N2, N1, E21); assertThat(network.edgesConnecting(N1, N2)).containsExactly(E12, E12_A, E21);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 33K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
} @Test public void edgesConnecting_parallelEdges_undirected() { assume().that(network.allowsParallelEdges()).isTrue(); assume().that(network.isDirected()).isFalse(); addEdge(N1, N2, E12); addEdge(N1, N2, E12_A); addEdge(N2, N1, E21); assertThat(network.edgesConnecting(N1, N2)).containsExactly(E12, E12_A, E21);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 32.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
} }; } @Override @CheckForNull public E edgeConnectingOrNull(N nodeU, N nodeV) { Set<E> edgesConnecting = edgesConnecting(nodeU, nodeV); switch (edgesConnecting.size()) { case 0: return null; case 1: return edgesConnecting.iterator().next(); default: throw new IllegalArgumentException(String.format(MULTIPLE_EDGES_CONNECTING, nodeU, nodeV));
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) -
android/guava/src/com/google/common/graph/StandardNetwork.java
} @Override public Set<N> adjacentNodes(N node) { return nodeInvalidatableSet(checkedConnections(node).adjacentNodes(), node); } @Override public Set<E> edgesConnecting(N nodeU, N nodeV) { NetworkConnections<N, E> connectionsU = checkedConnections(nodeU); if (!allowsSelfLoops && nodeU == nodeV) { // just an optimization, only check reference equality return ImmutableSet.of();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
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/GraphConstants.java
+ "so it cannot be reused to connect the following nodes: %s."; static final String MULTIPLE_EDGES_CONNECTING = "Cannot call edgeConnecting() when parallel edges exist between %s and %s. Consider calling " + "edgesConnecting() instead."; static final String PARALLEL_EDGES_NOT_ALLOWED = "Nodes %s and %s are already connected by a different edge. To construct a graph "
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* * <p>In an undirected network, this is equal to {@code edgesConnecting(nodeV, nodeU)}. * * <p>The resulting set of edges will be parallel (i.e. have equal {@link * #incidentNodes(Object)}). If this network does not {@link #allowsParallelEdges() allow parallel * edges}, the resulting set will contain at most one edge (equivalent to {@code * edgeConnecting(nodeU, nodeV).asSet()}). *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0)