- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 339 for Graph (0.12 sec)
-
android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
* limitations under the License. */ package com.google.common.graph; import static com.google.common.graph.TestUtil.assertEdgeNotInGraphErrorMessage; import static com.google.common.graph.TestUtil.assertEdgeRemovedFromGraphErrorMessage; import static com.google.common.graph.TestUtil.assertNodeNotInGraphErrorMessage; import static com.google.common.graph.TestUtil.assertNodeRemovedFromGraphErrorMessage;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 32.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
assertThat(graph.predecessors(node)).hasSize(graph.inDegree(node)); assertThat(graph.successors(node)).hasSize(graph.outDegree(node)); } else { int selfLoopCount = graph.adjacentNodes(node).contains(node) ? 1 : 0; assertThat(graph.degree(node)).isEqualTo(graph.adjacentNodes(node).size() + selfLoopCount);
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-tests/test/com/google/common/graph/ElementOrderTest.java
assertThat(graph.nodeOrder().comparator()).isEqualTo(Ordering.natural()); assertThat(graph.nodes()).containsExactly(node2, node4, node6, node8).inOrder(); } private static void addNodes(MutableGraph<Integer> graph) { graph.addNode(3); graph.addNode(1); graph.addNode(4); } private static void addEdges(MutableNetwork<Integer, String> network) { network.addEdge(3, 1, "i");
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
putEdge(N1, N1); assertThat(graph.degree(N1)).isEqualTo(2); putEdge(N1, N2); assertThat(graph.degree(N1)).isEqualTo(3); } @Test public void inDegree_selfLoop() { assume().that(graph.allowsSelfLoops()).isTrue(); putEdge(N1, N1); assertThat(graph.inDegree(N1)).isEqualTo(1); putEdge(N4, N1); assertThat(graph.inDegree(N1)).isEqualTo(2); }
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) -
tensorflow/c/c_test_util.cc
} TF_Operation* Mul(TF_Operation* l, TF_Operation* r, TF_Graph* graph, TF_Status* s, const char* name) { TF_Operation* op; BinaryOpHelper("Mul", l, r, graph, s, name, &op, "", true); return op; } TF_Operation* Add(TF_Output l, TF_Output r, TF_Graph* graph, TF_Status* s, const char* name) {
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Fri Oct 15 03:16:52 GMT 2021 - 17.8K bytes - Viewed (2) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/DefaultDependencyCoordinateFactory.java
request.isOptional(), map(request.getExclusions(), this::toExclusion))); } } private org.eclipse.aether.graph.Exclusion toExclusion(Exclusion exclusion) { return new org.eclipse.aether.graph.Exclusion(exclusion.getGroupId(), exclusion.getArtifactId(), "*", "*"); }
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Mon Mar 25 10:50:01 GMT 2024 - 3.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
*/ package com.google.common.graph; import static com.google.common.base.Preconditions.checkArgument; import static com.google.common.base.Preconditions.checkNotNull; import static com.google.common.graph.GraphConstants.DEFAULT_EDGE_COUNT; import static com.google.common.graph.GraphConstants.DEFAULT_NODE_COUNT; import static com.google.common.graph.GraphConstants.EDGE_NOT_IN_GRAPH;
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) -
maven-core/src/main/java/org/apache/maven/plugin/internal/DefaultPluginDependenciesResolver.java
import org.eclipse.aether.artifact.DefaultArtifact; import org.eclipse.aether.collection.CollectRequest; import org.eclipse.aether.collection.DependencyCollectionException; import org.eclipse.aether.graph.DependencyFilter; import org.eclipse.aether.graph.DependencyNode; import org.eclipse.aether.repository.RemoteRepository; import org.eclipse.aether.resolution.ArtifactDescriptorException; import org.eclipse.aether.resolution.ArtifactDescriptorRequest;
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 10K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ElementOrderTest.java
assertThat(graph.nodeOrder().comparator()).isEqualTo(Ordering.natural()); assertThat(graph.nodes()).containsExactly(node2, node4, node6, node8).inOrder(); } private static void addNodes(MutableGraph<Integer> graph) { graph.addNode(3); graph.addNode(1); graph.addNode(4); } private static void addEdges(MutableNetwork<Integer, String> network) { network.addEdge(3, 1, "i");
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java
// In this case the graphs are considered equivalent; the property differences are irrelevant. @Test public void equivalent_propertiesDiffer() { graph.putEdge(N1, N2); MutableGraph<Integer> g2 = GraphBuilder.from(graph).allowsSelfLoops(!graph.allowsSelfLoops()).build(); g2.putEdge(N1, N2); assertThat(graph).isEqualTo(g2); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 4.7K bytes - Viewed (0)