Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 70 of 589 for graphml (0.23 sec)

  2. github.com/gradle/gradle

    platforms/documentation/docs/src/docs/userguide/img/cpp-static-library-task-graph.png 

    cpp-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.1K bytes
    - Viewed (0)
  3. github.com/google/guava

    guava/src/com/google/common/graph/AbstractDirectedNetworkConnections.java 

     * limitations under the License.
 */

package com.google.common.graph;

import static com.google.common.base.Preconditions.checkNotNull;
import static com.google.common.base.Preconditions.checkState;
import static com.google.common.graph.Graphs.checkNonNegative;
import static com.google.common.graph.Graphs.checkPositive;
import static java.util.Objects.requireNonNull;
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Apr 26 17:43:39 UTC 2021
    - 4.5K bytes
    - Viewed (0)
  4. github.com/tensorflow/tensorflow

    tensorflow/compiler/mlir/tf2xla/mlir_bridge_rollout_policy.h 

    // to decide whether to emit metrics on unsupported features of the graph.
MlirBridgeRolloutPolicy GetMlirBridgeRolloutPolicy(
    const tensorflow::Graph& graph,
    const FunctionLibraryDefinition* function_library,
    std::optional<tensorflow::ConfigProto> config_proto,
    bool is_supported_by_replicated_brige,
    bool uses_uninitialized_resource_args, bool is_v1_compat,
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Fri Feb 16 23:11:04 UTC 2024
    - 3.5K bytes
    - Viewed (0)
  5. github.com/gradle/gradle

    platforms/documentation/docs/src/docs/userguide/authoring-builds/basics/build_lifecycle.adoc 

    Your build scripts and plugins configure this dependency graph.

For example, if your project tasks include `build`, `assemble`, `createDocs`, your build script(s) can ensure that they are executed in the order `build` -> `assemble` -> `createDoc`.

== Task Graphs

Gradle builds the task graph *before* executing any task.
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Wed Nov 29 11:17:49 UTC 2023
    - 4.2K bytes
    - Viewed (0)
  6. github.com/google/guava

    android/guava/src/com/google/common/graph/StandardNetwork.java 

     * map of edges to reference nodes. The reference node is defined to be the edge's source node on
 * directed graphs, and an arbitrary endpoint of the edge on undirected graphs.
 *
 * <p>Collection-returning accessors return unmodifiable views: the view returned will reflect
 * changes to the graph (if the graph is mutable) but may not be modified by the user.
 *
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Jan 22 17:29:38 UTC 2024
    - 6.9K bytes
    - Viewed (0)
  7. github.com/google/guava

    guava/src/com/google/common/graph/StandardNetwork.java 

     * map of edges to reference nodes. The reference node is defined to be the edge's source node on
 * directed graphs, and an arbitrary endpoint of the edge on undirected graphs.
 *
 * <p>Collection-returning accessors return unmodifiable views: the view returned will reflect
 * changes to the graph (if the graph is mutable) but may not be modified by the user.
 *
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Jan 22 17:29:38 UTC 2024
    - 6.9K bytes
    - Viewed (0)
  8. github.com/golang/go

    src/cmd/go/internal/mvs/graph.go 

    }

// NewGraph returns an incremental MVS graph containing only a set of root
// dependencies and using the given max function for version strings.
//
// The caller must ensure that the root slice is not modified while the Graph
// may be in use.
func NewGraph(cmp func(p, v1, v2 string) int, roots []module.Version) *Graph {
	g := &Graph{
		cmp:      cmp,
		roots:    slices.Clip(roots),
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Jun 01 02:52:19 UTC 2023
    - 6.3K bytes
    - Viewed (0)
  9. github.com/golang/go

    src/internal/profile/graph.go 

    // NodePtrSet is a collection of nodes. Trimming a graph or tree requires a set
// of objects which uniquely identify the nodes to keep. In a graph, NodeInfo
// works as a unique identifier; however, in a tree multiple nodes may share
// identical NodeInfos. A *Node does uniquely identify a node so we can use that
// instead. Though a *Node also uniquely identifies a node in a graph,
// currently, during trimming, graphs are rebuilt from scratch using only the
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Feb 05 20:59:15 UTC 2024
    - 13.1K bytes
    - Viewed (0)
  10. github.com/golang/go

    src/cmd/vendor/github.com/google/pprof/internal/driver/html/graph.html 

    <!DOCTYPE html>
<html>
<head>
  <meta charset="utf-8">
  <title>{{.Title}}</title>
  {{template "css" .}}
  {{template "graph_css" .}}
</head>
<body>
  {{template "header" .}}
  <div id="graph">
    {{.HTMLBody}}
  </div>
  {{template "script" .}}
  <script>viewer(new URL(window.location.href), {{.Nodes}});</script>
</body>
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 31 19:48:28 UTC 2024
    - 334 bytes
    - Viewed (0)
  11. github.com/tensorflow/tensorflow

    tensorflow/compiler/mlir/tensorflow/transforms/breakup-islands.cc 

        func::FuncOp func,
    const TF::SideEffectAnalysis::Info& side_effect_analysis) {
  auto graph_op_range = func.front().without_terminator();
  tf_executor::GraphOp graph_op;

  if (llvm::hasSingleElement(graph_op_range))
    graph_op = dyn_cast<tf_executor::GraphOp>(func.front().front());

  if (!graph_op) {
    func.emitError("expected function to contain only a graph_op");
    signalPassFailure();
    return;
  }
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Fri Aug 11 20:52:36 UTC 2023
    - 16.7K bytes
    - Viewed (0)
Back to top