- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 24 for incidents (0.19 sec)
-
guava-tests/test/com/google/common/graph/GraphsTest.java
directedGraph.putEdge(N1, N2); directedGraph.putEdge(N2, N1); directedGraph.putEdge(N1, N3); // only incident to one node in nodeSubset directedGraph.putEdge(N4, N4); directedGraph.putEdge(5, 6); // not incident to any node in nodeSubset MutableGraph<Integer> expectedSubgraph = GraphBuilder.directed().allowsSelfLoops(true).build(); expectedSubgraph.putEdge(N1, N2);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 24.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphMutationTest.java
assertThat(graph.removeNode(nodeList.get(i))).isTrue(); } assertThat(graph.nodes()).hasSize(NUM_NODES - numNodesToRemove); // Number of edges remaining is unknown (node's incident edges have been removed). AbstractGraphTest.validateGraph(graph); for (int i = numNodesToRemove; i < NUM_NODES; ++i) { assertThat(graph.removeNode(nodeList.get(i))).isTrue(); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableNetwork.java
* @since 27.1 */ @CanIgnoreReturnValue boolean addEdge(EndpointPair<N> endpoints, E edge); /** * Removes {@code node} if it is present; all edges incident to {@code node} will also be removed. * * @return {@code true} if the network was modified as a result of this call */ @CanIgnoreReturnValue boolean removeNode(N node); /**
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/Graphs.java
* that contains all of the nodes in {@code nodes}, and all of the {@link Network#edges() edges} * from {@code network} for which the {@link Network#incidentNodes(Object) incident nodes} are * both contained by {@code nodes}. * * @throws IllegalArgumentException if any element in {@code nodes} is not a node in the graph */ public static <N, E> MutableNetwork<N, E> inducedSubgraph(
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-tests/test/com/google/common/graph/GraphMutationTest.java
assertThat(graph.removeNode(nodeList.get(i))).isTrue(); } assertThat(graph.nodes()).hasSize(NUM_NODES - numNodesToRemove); // Number of edges remaining is unknown (node's incident edges have been removed). AbstractGraphTest.validateGraph(graph); for (int i = numNodesToRemove; i < NUM_NODES; ++i) { assertThat(graph.removeNode(nodeList.get(i))).isTrue(); }
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/src/com/google/common/graph/StandardMutableValueGraph.java
if (connections == null) { return false; } if (allowsSelfLoops()) { // Remove self-loop (if any) first, so we don't get CME while removing incident edges. if (connections.removeSuccessor(node) != null) { connections.removePredecessor(node); --edgeCount; } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Oct 21 01:50:30 GMT 2023 - 6.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphsTest.java
directedGraph.putEdge(N1, N2); directedGraph.putEdge(N2, N1); directedGraph.putEdge(N1, N3); // only incident to one node in nodeSubset directedGraph.putEdge(N4, N4); directedGraph.putEdge(5, 6); // not incident to any node in nodeSubset MutableGraph<Integer> expectedSubgraph = GraphBuilder.directed().allowsSelfLoops(true).build(); expectedSubgraph.putEdge(N1, N2);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 24.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConnections.java
*/ @ElementTypesAreNonnullByDefault interface GraphConnections<N, V> { Set<N> adjacentNodes(); Set<N> predecessors(); Set<N> successors(); /** * 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); /**
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) -
guava-tests/test/com/google/common/graph/NetworkMutationTest.java
assertThat(network.removeNode(nodeList.get(i))).isTrue(); } assertThat(network.nodes()).hasSize(NUM_NODES - numNodesToRemove); // Number of edges remaining is unknown (node's incident edges have been removed). AbstractNetworkTest.validateNetwork(network); for (int i = numNodesToRemove; i < NUM_NODES; ++i) { assertThat(network.removeNode(nodeList.get(i))).isTrue(); }
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/NetworkConnections.java
import com.google.errorprone.annotations.CanIgnoreReturnValue; import java.util.Set; import javax.annotation.CheckForNull; /** * An interface for representing and manipulating an origin node's adjacent nodes and incident edges * in a {@link Network}. * * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault interface NetworkConnections<N, E> {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.3K bytes - Viewed (0)