- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 200 for graphml (0.17 sec)
-
src/cmd/vendor/github.com/google/pprof/internal/graph/graph.go
} // New summarizes performance data from a profile into a graph. func New(prof *profile.Profile, o *Options) *Graph { if o.CallTree { return newTree(prof, o) } g, _ := newGraph(prof, o) return g } // newGraph computes a graph from a profile. It returns the graph, and // a map from the profile location indices to the corresponding graph // nodes.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 31K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_executor_ops.td
[Terminator, ControlOperandsAfterAllData, HasParent<"GraphOp">]> { let summary = [{ The `tf_executor.fetch` operation terminates the graph and returns values; }]; let description = [{ The non-control operands of the fetch operation are returned outside of the graph and must match the return type of the graph. }]; let arguments = (ins Variadic<AnyType>:$fetches );
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 23 19:35:12 UTC 2023 - 22K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/img/xcode-task-graph.png
xcode-task-graph.png...
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 23K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* terms</a>): * * <ul> * <li>directed graphs * <li>undirected graphs * <li>graphs that do/don't allow parallel edges * <li>graphs that do/don't allow self-loops * <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered * <li>graphs whose edges are unique objects * </ul> * * <h3>Building a {@code Network}</h3> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* terms</a>): * * <ul> * <li>directed graphs * <li>undirected graphs * <li>graphs that do/don't allow self-loops * <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered * <li>graphs whose edges have associated values * </ul> * * <p>{@code ValueGraph}, as a subtype of {@code Graph}, explicitly does not support parallel edges,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 15K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_executor.cc
// tf_executor.graph //===----------------------------------------------------------------------===// FetchOp GraphOp::GetFetch() { return llvm::cast<FetchOp>(GetBody().back()); } LogicalResult GraphOp::verify() { GraphOp graph = *this; auto *executorDialect = graph->getDialect(); if (graph.GetBody().empty()) return graph.emitOpError() << "expects a non-empty body";
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 42.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/tfg-to-tfe.cc
}); } class ConvertGraphOp : public OpConversionPattern<tfg::GraphOp> { public: using OpConversionPattern::OpConversionPattern; LogicalResult matchAndRewrite( tfg::GraphOp graph, OpAdaptor adaptor, ConversionPatternRewriter &rewriter) const final { Location loc = graph.getLoc(); // To keep the import-as-graph logic taken by TFG, we create `void func()`
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 17 17:58:54 UTC 2024 - 21.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/executor_island_coarsening.cc
MergedIsland* GetOperandCandidateToMergeWith(GraphOp graph, MergedIsland& merged_island); // Attempt to find an island group that consumes a result, either control or // data, from one of the islands in the given `merged_island`. If no candidate // can be found, returns nullptr. MergedIsland* GetResultCandidateToMergeWith(GraphOp graph,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 19.7K bytes - Viewed (0) -
plugin/pkg/auth/authorizer/node/graph.go
} // destinationEdge is a graph edge that includes a denormalized reference to the final destination vertex. // This should only be used when there is a single leaf vertex reachable from T. type destinationEdge struct { F graph.Node T graph.Node Destination graph.Node } func newDestinationEdge(from, to, destination graph.Node) graph.Edge {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 07 21:22:55 UTC 2024 - 17.5K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/img/swift-static-library-task-graph.png
swift-static-library-task-graph.png...
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 9.8K bytes - Viewed (0)