- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 1,797 for _Graph (0.12 sec)
-
android/guava/src/com/google/common/graph/GraphsBridgeMethods.java
return Graphs.transitiveClosure(graph); } @SuppressWarnings("PreferredInterfaceType") public static <N> Set<N> reachableNodes(Graph<N> graph, N node) { return Graphs.reachableNodes(graph, node); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 14 19:31:40 UTC 2024 - 707 bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/graph_pruning.cc
void PruneGraph(GraphOp graph); llvm::SmallDenseSet<mlir::StringAttr, 4> ops_to_preserve_ids_; }; // Checks if a tf_executor.Graph can be pruned. // For TensorFlow V1.0 compatibility: when importing a graph without providing // feeds/fetches/targets we should not attempt to prune. The best approximation // here is to check if the graph is of the "main" function and does not have the
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Oct 05 23:50:19 UTC 2022 - 7.6K 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) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Oct 15 03:16:52 UTC 2021 - 17.8K bytes - Viewed (0) -
tensorflow/c/python_api.cc
void ExportRecordMutation( // NOLINT: Intentionally unused function. TF_Graph* graph, const TF_Operation& op, const char* mutation_type) { mutex_lock l(graph->mu); RecordMutation(graph, op, mutation_type); } void AddControlInput(TF_Graph* graph, TF_Operation* op, TF_Operation* input) { TF_AddOperationControlInput(graph, op, input); } void SetAttr(TF_Graph* graph, TF_Operation* op, const char* attr_name,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Jul 12 18:48:56 UTC 2023 - 3.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/internal/mlir_bridge_pass_util.h
bool IsSupportedByReplicatedBridge( const Graph& graph, const FunctionLibraryDefinition* function_library); // Check if an MLIR module has any ops with _tpu_replicate or // _xla_compile_device_type=TPU. bool IsSupportedByReplicatedBridge(mlir::ModuleOp module); // Check if an MLIR module contains TPUPartitionedCall op. If so, we define // such graph as an inference graph. Otherwise, it is non inference graph.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Mar 13 16:33:22 UTC 2024 - 2.3K bytes - Viewed (0) -
tensorflow/c/c_test_util.h
TF_Operation* Placeholder(TF_Graph* graph, TF_Status* s, const char* name = "feed", TF_DataType dtype = TF_INT32, const std::vector<int64_t>& dims = {}); TF_Operation* Const(TF_Tensor* t, TF_Graph* graph, TF_Status* s, const char* name = "const"); TF_Operation* ScalarConst(bool v, TF_Graph* graph, TF_Status* s,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Aug 09 01:06:53 UTC 2018 - 6K bytes - Viewed (0) -
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/encapsulate_xla_computations_pass.cc
e->dst_input()); } } auto output = std::make_unique<Graph>((*graph)->op_registry()); TF_RETURN_WITH_CONTEXT_IF_ERROR( EncapsulateSubgraphsInFunctions( kXlaClusterIdAttr, **graph, RewriteSubgraph, /*reuse_existing_functions=*/true, &output, flib_def), "EncapsulateXlaComputationsPass failed"); graph->swap(output); return absl::OkStatus(); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 15.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/EndpointPairIterator.java
Iterator<N> successorIterator = ImmutableSet.<N>of().iterator(); static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) { return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph); } private EndpointPairIterator(BaseGraph<N> graph) { this.graph = graph; this.nodeIterator = graph.nodes().iterator(); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jul 09 17:31:04 UTC 2021 - 5K bytes - Viewed (0) -
subprojects/composite-builds/src/test/groovy/org/gradle/composite/internal/DefaultIncludedBuildTaskGraphTest.groovy
} def "cannot schedule tasks when graph has not been created"() { when: graph.locateTask(taskIdentifier(DefaultBuildIdentifier.ROOT, ":task")).queueForExecution() then: def e = thrown(IllegalStateException) e.message == "No work graph available for this thread." } def "cannot schedule tasks when after graph has finished execution"() { when:
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Mar 08 10:04:24 UTC 2024 - 5.3K bytes - Viewed (0)