- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 98 for edge (0.12 sec)
-
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
} Collections.shuffle(edgeList, gen); for (EndpointPair<Integer> edge : edgeList) { assertThat(graph.putEdge(edge.nodeU(), edge.nodeV())).isTrue(); } assertThat(graph.nodes()).hasSize(NUM_NODES); assertThat(graph.edges()).hasSize(NUM_EDGES); AbstractGraphTest.validateGraph(graph); } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
} // Node sets are the same, but edge sets differ. @Test public void equivalent_edgeSetsDiffer() { network.addEdge(N1, N2, E12); MutableNetwork<Integer, String> g2 = createNetwork(edgeType); g2.addEdge(N1, N2, E13); assertThat(network).isNotEqualTo(g2); } // Node/edge sets are the same, but node/edge connections differ due to edge type. @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 5.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableNetwork.java
// Thus we avoid modifying the underlying view while iterating over it. for (E edge : ImmutableList.copyOf(connections.incidentEdges())) { removeEdge(edge); } nodeConnections.remove(node); return true; } @Override @CanIgnoreReturnValue public boolean removeEdge(E edge) { checkNotNull(edge, "edge"); N nodeU = edgeToReferenceNode.get(edge);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 5.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractDirectedNetworkConnections.java
} @Override public N adjacentNode(E edge) { // Since the reference node is defined to be 'source' for directed graphs, // we can assume this edge lives in the set of outgoing edges. // (We're relying on callers to call this method only with an edge that's in the graph.) return requireNonNull(outEdgeMap.get(edge)); } @Override public N removeInEdge(E edge, boolean isSelfLoop) { if (isSelfLoop) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableValueGraph.java
* * @return the value previously associated with the edge connecting {@code nodeU} to {@code * nodeV}, or null if there was no such edge. * @throws IllegalArgumentException if the introduction of the edge would violate {@link * #allowsSelfLoops()} */ @CanIgnoreReturnValue @CheckForNull V putEdgeValue(N nodeU, N nodeV, V value); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConnections.java
/** * Returns an iterator over the incident edges. * * @param thisNode The node that this all of the connections in this class are connected to. */ Iterator<EndpointPair<N>> incidentEdgeIterator(N thisNode); /** * Returns the value associated with the edge connecting the origin node to {@code node}, or null * if there is no such edge. */ @CheckForNull V value(N node);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/UndirectedMultiNetworkConnections.java
} }; } @Override @CheckForNull public N removeInEdge(E edge, boolean isSelfLoop) { if (!isSelfLoop) { return removeOutEdge(edge); } return null; } @Override public N removeOutEdge(E edge) { N node = super.removeOutEdge(edge); Multiset<N> adjacentNodes = getReference(adjacentNodesReference); if (adjacentNodes != null) {
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) -
guava-tests/test/com/google/common/graph/NetworkMutationTest.java
ArrayList<Object> edgeList = new ArrayList<>(network.edges()); assertThat(network.nodes()).hasSize(NUM_NODES); assertThat(network.edges()).hasSize(NUM_EDGES); AbstractNetworkTest.validateNetwork(network); Collections.shuffle(edgeList, gen); int numEdgesToRemove = gen.nextInt(NUM_EDGES); for (int i = 0; i < numEdgesToRemove; ++i) { Object edge = edgeList.get(i);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkBuilder.java
NetworkBuilder<N1, E1> castBuilder = cast(); return new ImmutableNetwork.Builder<>(castBuilder); } /** * Specifies whether the network will allow parallel edges. Attempting to add a parallel edge to a * network that does not allow them will throw an {@link UnsupportedOperationException}. * * <p>The default value is {@code false}. */ @CanIgnoreReturnValue
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java
} // Node/edge sets are the same, but node/edge connections differ due to edge type. @Test public void equivalent_directedVsUndirected() { graph.putEdge(N1, N2); MutableGraph<Integer> g2 = createGraph(oppositeType(edgeType)); g2.putEdge(N1, N2); assertThat(graph).isNotEqualTo(g2); } // Node/edge sets and node/edge connections are the same, but directedness differs.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 4.7K bytes - Viewed (0)