- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 46 for begreep (0.18 sec)
-
android/guava/src/com/google/common/graph/GraphConstants.java
private GraphConstants() {} static final int EXPECTED_DEGREE = 2; static final int DEFAULT_NODE_COUNT = 10; static final int DEFAULT_EDGE_COUNT = DEFAULT_NODE_COUNT * EXPECTED_DEGREE; // Load factor and capacity for "inner" (i.e. per node/edge element) hash sets or maps static final float INNER_LOAD_FACTOR = 1.0f; static final int INNER_CAPACITY = 2; // ceiling(EXPECTED_DEGREE / INNER_LOAD_FACTOR) // Error messages
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/ForwardingNetwork.java
return delegate().incidentNodes(edge); } @Override public Set<E> adjacentEdges(E edge) { return delegate().adjacentEdges(edge); } @Override public int degree(N node) { return delegate().degree(node); } @Override public int inDegree(N node) { return delegate().inDegree(node); } @Override public int outDegree(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/src/com/google/common/graph/AbstractNetwork.java
@Override public Set<N> successors(N node) { return AbstractNetwork.this.successors(node); } // DO NOT override the AbstractGraph *degree() implementations. }; } @Override public int degree(N node) { if (isDirected()) { return IntMath.saturatedAdd(inEdges(node).size(), outEdges(node).size()); } else {
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/ValueGraph.java
* * @throws IllegalArgumentException if {@code node} is not an element of this graph */ @Override int degree(N node); /** * Returns the count of {@code node}'s incoming edges (equal to {@code predecessors(node).size()}) * in a directed graph. In an undirected graph, returns the {@link #degree(Object)}. * * <p>If the count is greater than {@code Integer.MAX_VALUE}, returns {@code Integer.MAX_VALUE}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
.containsExactly(EndpointPair.unordered(N1, N1), EndpointPair.unordered(N1, N2)); } @Test public void degree_selfLoop() { assume().that(graph.allowsSelfLoops()).isTrue(); putEdge(N1, N1); assertThat(graph.degree(N1)).isEqualTo(2); putEdge(N1, N2); assertThat(graph.degree(N1)).isEqualTo(3); } @Test public void inDegree_selfLoop() {
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/AbstractValueGraph.java
} @Override public Set<N> successors(N node) { return AbstractValueGraph.this.successors(node); } @Override public int degree(N node) { return AbstractValueGraph.this.degree(node); } @Override public int inDegree(N node) { return AbstractValueGraph.this.inDegree(node); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 17 13:59:28 GMT 2023 - 4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
assertThat(network.incidentNodes(E11).target()).isEqualTo(N1); } @Test public void degree_selfLoop() { assume().that(network.allowsSelfLoops()).isTrue(); addEdge(N1, N1, E11); assertThat(network.degree(N1)).isEqualTo(2); addEdge(N1, N2, E12); assertThat(network.degree(N1)).isEqualTo(3); } @Test public void inDegree_selfLoop() {
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) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
.containsExactly(EndpointPair.ordered(N1, N1), EndpointPair.ordered(N1, N2)); } @Test public void degree_selfLoop() { assume().that(graph.allowsSelfLoops()).isTrue(); putEdge(N1, N1); assertThat(graph.degree(N1)).isEqualTo(2); putEdge(N1, N2); assertThat(graph.degree(N1)).isEqualTo(3); } @Test public void inDegree_selfLoop() {
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-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
.containsExactly(EndpointPair.unordered(N1, N1), EndpointPair.unordered(N1, N2)); } @Test public void degree_selfLoop() { assume().that(graph.allowsSelfLoops()).isTrue(); putEdge(N1, N1); assertThat(graph.degree(N1)).isEqualTo(2); putEdge(N1, N2); assertThat(graph.degree(N1)).isEqualTo(3); } @Test public void inDegree_selfLoop() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
* * @throws IllegalArgumentException if {@code node} is not an element of this graph */ int degree(N node); /** * Returns the count of {@code node}'s incoming edges (equal to {@code predecessors(node).size()}) * in a directed graph. In an undirected graph, returns the {@link #degree(Object)}. * * <p>If the count is greater than {@code Integer.MAX_VALUE}, returns {@code Integer.MAX_VALUE}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 8.8K bytes - Viewed (0)