- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 58 for accident (0.07 sec)
-
guava/src/com/google/common/graph/MutableValueGraph.java
* @since 27.1 */ @CanIgnoreReturnValue @CheckForNull V putEdgeValue(EndpointPair<N> endpoints, V value); /** * Removes {@code node} if it is present; all edges incident to {@code node} will also be removed. * * @return {@code true} if the graph was modified as a result of this call */ @CanIgnoreReturnValue boolean removeNode(N node); /**
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.4K bytes - Viewed (0) -
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> {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.3K bytes - Viewed (0) -
guava/src/com/google/common/graph/ValueGraph.java
/** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of * self-loops incident to {@code node}). *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 16K 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(); }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Aug 18 16:17:46 UTC 2017 - 4.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
/** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of * self-loops incident to {@code node}). *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 13.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graph.java
/** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of * self-loops incident to {@code node}). *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 13.7K bytes - Viewed (0) -
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); /**
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.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(); }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Apr 10 19:42:18 UTC 2024 - 4.5K bytes - Viewed (0) -
docs/en/mkdocs.yml
name: Switch to light mode - media: '(prefers-color-scheme: light)' scheme: default primary: teal accent: amber toggle: icon: material/lightbulb name: Switch to dark mode - media: '(prefers-color-scheme: dark)' scheme: slate primary: teal accent: amber toggle: icon: material/lightbulb-outline name: Switch to system preference features:
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Tue Oct 22 20:28:02 UTC 2024 - 10.4K bytes - Viewed (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolver.java
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 8.2K bytes - Viewed (0)