- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 340 for Graph (0.19 sec)
-
tensorflow/c/c_api_experimental_test.cc
std::unique_ptr<TF_Graph, decltype(&TF_DeleteGraph)> func_graph( TF_NewGraph(), TF_DeleteGraph); std::unique_ptr<TF_Status, decltype(&TF_DeleteStatus)> s(TF_NewStatus(), TF_DeleteStatus); TF_Operation* feed = Placeholder(func_graph.get(), s.get()); TF_Operation* neg = Neg(feed, func_graph.get(), s.get());
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Tue Jan 17 22:27:52 GMT 2023 - 13.1K bytes - Viewed (1) -
android/guava-tests/test/com/google/common/graph/GraphPropertiesTest.java
public void hasCycle_isolatedNodes() { for (MutableGraph<Integer> graph : graphsToTest) { graph.addNode(1); graph.addNode(2); } assertThat(hasCycle(directedGraph)).isFalse(); assertThat(hasCycle(undirectedGraph)).isFalse(); } @Test public void hasCycle_oneEdge() { for (MutableGraph<Integer> graph : graphsToTest) { graph.putEdge(1, 2); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 19 21:11:54 GMT 2017 - 5.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableGraph.java
* * <p>If the graph is directed, the resultant edge will be directed; otherwise, it will be * undirected. * * <p>If {@code nodeU} and {@code nodeV} are not already present in this graph, this method will * silently {@link #addNode(Object) add} {@code nodeU} and {@code nodeV} to the graph. * * @return {@code true} if the graph was modified as a result of this call
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphMutationTest.java
MutableGraph<Integer> graph = graphBuilder.allowsSelfLoops(true).build(); assertThat(graph.nodes()).isEmpty(); assertThat(graph.edges()).isEmpty(); AbstractGraphTest.validateGraph(graph); while (graph.nodes().size() < NUM_NODES) { graph.addNode(gen.nextInt(NODE_POOL_SIZE)); } ArrayList<Integer> nodeList = new ArrayList<>(graph.nodes());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/IncidentEdgeSet.java
final N node; final BaseGraph<N> graph; IncidentEdgeSet(BaseGraph<N> graph, N node) { this.graph = graph; this.node = node; } @Override public boolean remove(@CheckForNull Object o) { throw new UnsupportedOperationException(); } @Override public int size() { if (graph.isDirected()) { return graph.inDegree(node) + graph.outDegree(node)
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
*/ package com.google.common.graph; import static com.google.common.base.Preconditions.checkArgument; import static com.google.common.base.Preconditions.checkNotNull; import static com.google.common.base.Preconditions.checkState; import static com.google.common.graph.GraphConstants.ENDPOINTS_MISMATCH; import static com.google.common.graph.GraphConstants.NODE_PAIR_REMOVED_FROM_GRAPH;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 7.2K bytes - Viewed (0) -
tensorflow/c/c_api_test.cc
EXPECT_EQ(1, TF_ImportGraphDefOptionsNumReturnOperations(opts)); tensorflow::GraphDef graph_def_proto; ASSERT_TRUE(tensorflow::ParseProtoUnlimited(&graph_def_proto, graph_def->data, graph_def->length)); TF_Buffer graph_def_buffer; graph_def_buffer.data = reinterpret_cast<const void*>(&graph_def_proto); graph_def_buffer.length = sizeof(tensorflow::GraphDef*); TF_ImportGraphDefResults* results =
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 96.9K bytes - Viewed (3) -
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); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 14 19:31:40 GMT 2024 - 707 bytes - Viewed (0) -
tensorflow/c/c_api_internal.h
// will eventually contain the full while loop. TF_Graph* parent; TF_Output* parent_inputs; }; struct TF_OperationDescription { TF_OperationDescription(TF_Graph* g, const char* op_type, const char* node_name) : node_builder(node_name, op_type, g->graph.op_registry()), graph(g) {} tensorflow::NodeBuilder node_builder; TF_Graph* graph;
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Sat May 13 00:49:12 GMT 2023 - 7.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConstants.java
// Error messages static final String NODE_NOT_IN_GRAPH = "Node %s is not an element of this graph."; static final String EDGE_NOT_IN_GRAPH = "Edge %s is not an element of this graph."; static final String NODE_REMOVED_FROM_GRAPH = "Node %s that was used to generate this set is no longer in the graph."; static final String NODE_PAIR_REMOVED_FROM_GRAPH =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.1K bytes - Viewed (0)