- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 33 for begreep (0.15 sec)
-
android/guava/src/com/google/common/graph/UndirectedNetworkConnections.java
* See the License for the specific language governing permissions and * limitations under the License. */ package com.google.common.graph; import static com.google.common.graph.GraphConstants.EXPECTED_DEGREE; import com.google.common.collect.BiMap; import com.google.common.collect.HashBiMap; import com.google.common.collect.ImmutableBiMap; import java.util.Collections; import java.util.Map; import java.util.Set;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 1.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
* graphs. Instances of this class should be constructed with {@link ValueGraphBuilder}. * * <p>Time complexities for mutation methods are all O(1) except for {@code removeNode(N node)}, * which is in O(d_node) where d_node is the degree of {@code node}. * * @author James Sexton * @author Joshua O'Madadhain * @author Omar Darwish * @param <N> Node parameter type * @param <V> Value parameter type */ @ElementTypesAreNonnullByDefault
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) -
guava-tests/test/com/google/common/graph/ValueGraphTest.java
assertThat(graph.predecessors(node)).isEqualTo(asGraph.predecessors(node)); assertThat(graph.successors(node)).isEqualTo(asGraph.successors(node)); assertThat(graph.degree(node)).isEqualTo(asGraph.degree(node)); assertThat(graph.inDegree(node)).isEqualTo(asGraph.inDegree(node)); assertThat(graph.outDegree(node)).isEqualTo(asGraph.outDegree(node)); for (Integer otherNode : graph.nodes()) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 18:35:19 GMT 2024 - 20K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
} @Test public void degree_oneEdge() { putEdge(N1, N2); assertThat(graph.degree(N1)).isEqualTo(1); assertThat(graph.degree(N2)).isEqualTo(1); } @Test public void degree_isolatedNode() { addNode(N1); assertThat(graph.degree(N1)).isEqualTo(0); } @Test public void degree_nodeNotInGraph() { assertNodeNotInGraphErrorMessage(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingValueGraph.java
return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @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) { return delegate().outDegree(node);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.9K bytes - Viewed (0) -
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 Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.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) -
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/src/com/google/common/graph/DirectedNetworkConnections.java
super(inEdgeMap, outEdgeMap, selfLoopCount); } static <N, E> DirectedNetworkConnections<N, E> of() { return new DirectedNetworkConnections<>( HashBiMap.<E, N>create(EXPECTED_DEGREE), HashBiMap.<E, N>create(EXPECTED_DEGREE), 0); } static <N, E> DirectedNetworkConnections<N, E> ofImmutable( Map<E, N> inEdges, Map<E, N> outEdges, int selfLoopCount) { return new DirectedNetworkConnections<>(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 2.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingGraph.java
return delegate().successors(node); } @Override public Set<EndpointPair<N>> incidentEdges(N node) { return delegate().incidentEdges(node); } @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) { return delegate().outDegree(node);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.5K bytes - Viewed (0)