- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 425 for graphml (0.17 sec)
-
android/guava/src/com/google/common/graph/Graph.java
* "Choosing the right graph type"</a> section of the Guava User Guide for more details. * * <h3>Capabilities</h3> * * <p>{@code Graph} supports the following use cases (<a * href="https://github.com/google/guava/wiki/GraphsExplained#definitions">definitions of * terms</a>): * * <ul> * <li>directed graphs * <li>undirected graphs * <li>graphs that do/don't allow self-loops
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 13.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graph.java
* "Choosing the right graph type"</a> section of the Guava User Guide for more details. * * <h3>Capabilities</h3> * * <p>{@code Graph} supports the following use cases (<a * href="https://github.com/google/guava/wiki/GraphsExplained#definitions">definitions of * terms</a>): * * <ul> * <li>directed graphs * <li>undirected graphs * <li>graphs that do/don't allow self-loops
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 13.6K bytes - Viewed (0) -
maven-core/src/test/java/org/apache/maven/project/GraphTest.java
Graph graph3 = new Graph(); graph3.addVertex("a"); graph3.addVertex("b"); graph3.addVertex("c"); graph3.addVertex("d"); graph3.addVertex("e"); graph3.addVertex("f"); addEdge(graph3, "a", "b"); addEdge(graph3, "b", "c"); addEdge(graph3, "b", "d"); addEdge(graph3, "c", "d"); addEdge(graph3, "c", "e"); addEdge(graph3, "f", "d");
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Sep 22 06:02:04 UTC 2023 - 8.3K bytes - Viewed (0) -
src/unicode/graphic.go
) // GraphicRanges defines the set of graphic characters according to Unicode. var GraphicRanges = []*RangeTable{ L, M, N, P, S, Zs, } // PrintRanges defines the set of printable characters according to Go. // ASCII space, U+0020, is handled separately. var PrintRanges = []*RangeTable{ L, M, N, P, S, } // IsGraphic reports whether the rune is defined as a Graphic by Unicode.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 06 20:02:46 UTC 2023 - 4.4K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/driver/svg.go
// viewBox="___" xmlns=...> // <g id="graph0" transform="..."> // ... // </g> // </svg> // // Change it to // // <svg width="100%" height="100%" // xmlns=...> // <script type="text/ecmascript"><![CDATA[` ..$(svgpan.JSSource)... `]]></script>` // <g id="viewport" transform="translate(0,0)"> // <g id="graph0" transform="..."> // ... // </g> // </g>
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 16 15:19:53 UTC 2024 - 2.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/tensorflow/passes/merge_save_function_ops_to_main.cc
// `FetchOp` will be used without modified. Returns the fetch operands from the // `scr_graph_op`. Value CloneGraphOps(GraphOp src_graph_op, GraphOp dst_graph_op, IRMapping& mapper) { Block& main_body = dst_graph_op.GetBody(); // Take the reference of the main graph's FetchOp to later move to the end. FetchOp main_fetch_op = dst_graph_op.GetFetch(); Block& save_func_body = src_graph_op.GetBody();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 10.7K 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) -
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) -
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) -
test/typeparam/graph.go
} } } return true } // A Graph is a collection of nodes. A node may have an arbitrary number // of edges. An edge connects two nodes. Both nodes and edges must be // comparable. This is an undirected simple graph. type _Graph[_Node _NodeC[_Edge], _Edge _EdgeC[_Node]] struct { nodes []_Node } // _NodeC is the constraints on a node in a graph, given the _Edge type. type _NodeC[_Edge any] interface {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:28 UTC 2024 - 5.7K bytes - Viewed (0)