- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 18 for edges (0.23 sec)
-
guava-tests/test/com/google/common/graph/NetworkMutationTest.java
ArrayList<Object> edgeList = new ArrayList<>(network.edges()); assertThat(network.nodes()).hasSize(NUM_NODES); assertThat(network.edges()).hasSize(NUM_EDGES); AbstractNetworkTest.validateNetwork(network); Collections.shuffle(edgeList, gen); int numEdgesToRemove = gen.nextInt(NUM_EDGES); for (int i = 0; i < numEdgesToRemove; ++i) { Object edge = edgeList.get(i);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolverTest.java
"wrong # of v2 incident edges in the resulting graph after resolver"); assertEquals( "1.2", res.getIncidentEdges(v2).get(0).getVersion(), "wrong edge v1-v2 in the resulting graph after resolver"); assertEquals( 1, res.getIncidentEdges(v3).size(), "wrong # of edges v1-v3 in the resulting graph after resolver");
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 8.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java
ArrayList<Object> edgeList = new ArrayList<>(network.edges()); assertThat(network.nodes()).hasSize(NUM_NODES); assertThat(network.edges()).hasSize(NUM_EDGES); AbstractNetworkTest.validateNetwork(network); Collections.shuffle(edgeList, gen); int numEdgesToRemove = gen.nextInt(NUM_EDGES); for (int i = 0; i < numEdgesToRemove; ++i) { Object edge = edgeList.get(i);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
tensorflow/c/c_api.cc
mutex_lock l(graph->mu); std::vector<const tensorflow::Edge*> control_edges; for (const tensorflow::Edge* edge : op->node.in_edges()) { if (!edge->IsControlEdge()) continue; control_edges.push_back(edge); } for (const tensorflow::Edge* edge : control_edges) { graph->graph.RemoveControlEdge(edge); } } void TF_SetRequireShapeInferenceFns(TF_Graph* graph, bool require) {
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 102.3K bytes - Viewed (0) -
tensorflow/c/c_api_test.cc
ASSERT_EQ(1, TF_OperationNumInputs(neg)); TF_Output neg_input = TF_OperationInput({neg, 0}); EXPECT_EQ(scalar, neg_input.oper); EXPECT_EQ(0, neg_input.index); // Test that we can't see control edges involving the source and sink nodes. TF_Operation* control_ops[100]; EXPECT_EQ(0, TF_OperationNumControlInputs(scalar)); EXPECT_EQ(0, TF_OperationGetControlInputs(scalar, control_ops, 100));
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 96.9K bytes - Viewed (3) -
maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolutionPolicyTest.java
MetadataGraphEdge res; res = policy.apply(e1, e2); assertEquals("1.1", res.getVersion(), "Wrong depth edge selected"); res = policy.apply(e1, e3); assertEquals("1.2", res.getVersion(), "Wrong version edge selected"); } // ------------------------------------------------------------------------------------------
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 2.2K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/internal/impl/Graph.java
from.children.add(to); to.parents.add(from); List<String> cycle = findCycle(to); if (cycle != null) { // remove edge which introduced cycle removeEdge(from, to); throw new CycleDetectedException( "Edge between '" + from.label + "' and '" + to.label + "' introduces to cycle in the graph", cycle); } } void removeEdge(Vertex from, Vertex to) {
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 4.5K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/Graph.java
List<String> cycle = visitCycle(graph, Collections.singleton(to), new HashMap<>(), new LinkedList<>()); if (cycle != null) { // remove edge which introduced cycle throw new CycleDetectedException( "Edge between '" + from + "' and '" + to + "' introduces to cycle in the graph", cycle); } } } private enum DfsState { VISITING,
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 3.3K bytes - Viewed (0) -
docs/ru/docs/deployment/concepts.md
Plain Text - Registered: Sun Apr 28 07:19:10 GMT 2024 - Last Modified: Thu Apr 18 19:53:19 GMT 2024 - 32.5K bytes - Viewed (0) -
architecture/ambient/ztunnel.md
Instead, an Istio specific field like `ExpectedTLSIdentity: spiffe://foo.bar` can encode the same information, at a fraction of the cost. In our testing, even the most generous representations give custom types a 10x edge (in size, allocations, and CPU time) over Envoy types. In addition, they are more clear and strictly typed; using Envoy types would require us to put a lot of information in untyped `metadata` maps.
Plain Text - Registered: Wed May 01 22:53:12 GMT 2024 - Last Modified: Thu Apr 25 22:35:16 GMT 2024 - 16.6K bytes - Viewed (0)