- Sort Score
- Result 10 results
- Languages All
Results 161 - 170 of 1,797 for _Graph (0.09 sec)
-
maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultClasspathTransformationTestType.java
* v3-v4 * */ v1 = graph.addVertex(new ArtifactMetadata("g", "a1", "1.0")); graph.setEntry(v1); v2 = graph.addVertex(new ArtifactMetadata("g", "a2", "1.0")); v3 = graph.addVertex(new ArtifactMetadata("g", "a3", "1.0")); v4 = graph.addVertex(new ArtifactMetadata("g", "a4", "1.0")); // v1-->v2 graph.addEdge(v1, v2, new MetadataGraphEdge("1.1", true, null, null, 2, 1));
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Apr 25 05:46:50 UTC 2024 - 4.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraphBuilder.java
* * <pre>{@code * // Building a mutable value graph * MutableValueGraph<String, Double> graph = * ValueGraphBuilder.undirected().allowsSelfLoops(true).build(); * graph.putEdgeValue("San Francisco", "San Francisco", 0.0); * graph.putEdgeValue("San Jose", "San Jose", 0.0); * graph.putEdgeValue("San Francisco", "San Jose", 48.4); * * // Building an immutable value graph * ImmutableValueGraph<String, Double> immutableGraph =
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 03 01:21:31 UTC 2022 - 8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
* * <h3>Usage</h3> * * Given an algorithm, for example: * * <pre>{@code * public <N> someGraphAlgorithm(N startNode, PredecessorsFunction<N> predecessorsFunction); * }</pre> * * you will invoke it depending on the graph representation you're using. * * <p>If you have an instance of one of the primary {@code common.graph} types ({@link Graph}, * {@link ValueGraph}, and {@link Network}):
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.1K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_cluster_util.cc
string DescribeCycle(const GraphCycles* cycles, const Graph& graph, int src, int dst) { int32_t max_path_size = graph.num_node_ids() + 1; std::vector<int32> path(max_path_size); int32_t path_size = cycles->FindPath(dst, src, max_path_size, path.data()); if (path_size == 0) { return ""; } auto node_name = [&graph](int node_id) { if (!FastBoundsCheck(node_id, graph.num_node_ids())) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 29 08:39:39 UTC 2024 - 21.3K bytes - Viewed (0) -
platforms/core-configuration/stdlib-serialization-codecs/src/main/kotlin/org/gradle/internal/serialize/codecs/stdlib/ProxyCodec.kt
import org.gradle.internal.serialize.graph.codecs.Decoding import org.gradle.internal.serialize.graph.codecs.Encoding import org.gradle.internal.serialize.graph.codecs.EncodingProducer import org.gradle.internal.serialize.graph.ReadContext import org.gradle.internal.serialize.graph.WriteContext import org.gradle.internal.serialize.graph.readClassArray import org.gradle.internal.serialize.graph.writeClassArray
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Jun 04 18:56:44 UTC 2024 - 1.7K bytes - Viewed (0) -
tensorflow/compiler/jit/encapsulate_xla_computations_pass.h
static Status Encapsulate(std::unique_ptr<Graph>* graph, FunctionLibraryDefinition* flib_def); // b) we rewrite the function calls generated in phase (a) into XlaLaunch // operators. We also convert the XlaClusterOutput output nodes of the // function call into the outputs of the XlaLaunch operator. static Status BuildXlaLaunchOps(Graph* graph); struct XlaFunctionInfo {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 06:59:07 UTC 2024 - 3.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* * <h3>Usage</h3> * * Given an algorithm, for example: * * <pre>{@code * public <N> someGraphAlgorithm(N startNode, SuccessorsFunction<N> successorsFunction); * }</pre> * * you will invoke it depending on the graph representation you're using. * * <p>If you have an instance of one of the primary {@code common.graph} types ({@link Graph}, * {@link ValueGraph}, and {@link Network}):
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/mlir_graph_optimization_pass.cc
VLOG(2) << "Run MLIR graph optimization pass: " << StringRefToView(name); VLOG(2) << "Graph #nodes " << (*graph)->num_nodes() << " #edges " << (*graph)->num_edges(); timings.Reset({kTfMlirCategory, name.str()}); pass_status = pass_registration.pass->Run( function_name, config_proto, *module_ref, **graph, *flib_def); timings.ReportAndStop();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Jun 12 22:19:26 UTC 2024 - 18.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/mlir2graphdef/output-shapes-attr.mlir
%graph = tf_executor.graph { tf_executor.fetch %arg0 : tensor<2xi32> } func.return %graph#0 : tensor<2xi32> } // Test with a TPUPartitionedCallOp that is not inlined. func.func @dont_inline_tpu_partitioned_call(%arg0: tensor<2xi32> {tf._user_specified_name = "inputs_0"}, %arg1: tensor<2xi32> {tf._user_specified_name = "inputs_1"}) -> tensor<2xi32> { %graph = tf_executor.graph {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Mar 25 12:28:56 UTC 2022 - 3.4K bytes - Viewed (0) -
tensorflow/compiler/jit/mark_for_compilation_pass_test_helper.cc
} /*static*/ Status MarkForCompilationPassTestHelper::MarkForCompilation( std::unique_ptr<Graph>* graph, MarkForCompilationPassTestHelper::Options options) { FunctionDefLibrary flib; FunctionLibraryDefinition flib_def((*graph)->op_registry(), flib); return MarkForCompilation(graph, &flib_def, options); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 09 19:51:48 UTC 2023 - 3.1K bytes - Viewed (0)