- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 33 for begreep (0.33 sec)
-
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 Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
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/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/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) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
assertThat(network.successors(N1)).containsExactly(N1, N2); } @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 Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 19.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableGraph.java
* graphs. Instances of this class should be constructed with {@link GraphBuilder}. * * <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 * @param <N> Node parameter type */ @ElementTypesAreNonnullByDefault final class StandardMutableGraph<N> extends ForwardingGraph<N> implements MutableGraph<N> {
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/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 Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
android/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 May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 17.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
// We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory. final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed /** Constructs a graph with the properties specified in {@code builder}. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.9K bytes - Viewed (0) -
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)