- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 1,436 for grape (0.08 sec)
-
tensorflow/compiler/mlir/lite/experimental/tac/tests/e2e/simple-graph.mlir
Christian Sigg <******@****.***> 1714640622 -0700
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 02 09:41:17 UTC 2024 - 1.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/graphdef2mlir/graph-function-call.pbtxt
Adrian Kuegel <******@****.***> 1698648479 -0700
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Oct 30 06:52:55 UTC 2023 - 1.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/graphdef2mlir/graph-custom-operation.pbtxt
Adrian Kuegel <******@****.***> 1698648479 -0700
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Oct 30 06:52:55 UTC 2023 - 1.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/graphdef2mlir/graph-function-name-bug.pbtxt
Adrian Kuegel <******@****.***> 1698648479 -0700
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Oct 30 06:52:55 UTC 2023 - 2K bytes - Viewed (0) -
platforms/documentation/docs/src/snippets/dependencyManagement/workingWithDependencies-walkGraph/tests/walking-dependency-graph.sample.conf
Laura Kassovic <******@****.***> 1701107622 -0800
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 106 bytes - Viewed (0) -
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);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 16.6K bytes - Viewed (0) -
tensorflow/compiler/jit/mark_for_compilation_pass_test.cc
Node* read_1 = MakeRead(root, "R1"); root.graph()->AddControlEdge(write_0, neutral_0); root.graph()->AddControlEdge(neutral_0, read_0); root.graph()->AddControlEdge(read_0, write_1); root.graph()->AddControlEdge(write_1, neutral_1); root.graph()->AddControlEdge(neutral_1, read_1); FixupSourceAndSinkEdges(root.graph()); std::unique_ptr<Graph> graph(new Graph(OpRegistry::Global()));
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 14 10:11:10 UTC 2024 - 79.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
*/ public static <N> Graph<N> transpose(Graph<N> graph) { if (!graph.isDirected()) { return graph; // the transpose of an undirected graph is an identical graph } if (graph instanceof TransposedGraph) { return ((TransposedGraph<N>) graph).graph; } return new TransposedGraph<>(graph); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/test/groovy/org/gradle/model/internal/registry/ModelGraphTest.groovy
b.addLink c when: graph.add(a) graph.add(b) graph.add(c) graph.addListener(listener) then: 1 * listener.onDiscovered(b) 1 * listener.onDiscovered(c) 0 * listener.onDiscovered(_) when: graph.add(d) graph.add(e) graph.add(f) then:
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Sep 28 09:51:04 UTC 2023 - 7.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
*/ public static <N> Graph<N> transpose(Graph<N> graph) { if (!graph.isDirected()) { return graph; // the transpose of an undirected graph is an identical graph } if (graph instanceof TransposedGraph) { return ((TransposedGraph<N>) graph).graph; } return new TransposedGraph<>(graph); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0)