- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 102 for Graph (0.14 sec)
-
tensorflow/c/eager/c_api_distributed_test.cc
} return tensorflow::errors::Internal("Graph pass runs for more than once!"); } private: bool first_call_ = true; }; // After the graph pass is registered, it takes effect globally and can affect // other test cases. Define a static variable to switch it on and off. bool GraphErrorInjectionPass::enabled_ = false; // Test to ensure that a registered graph optimization pass is only executed
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Thu Feb 15 09:49:45 GMT 2024 - 23.5K 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); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
assertThat(graph.requestedNodes).containsExactly('a', 'a', 'a', 'b', 'b'); } @Test public void forGraph_breadthFirstIterable_iterableIsLazy() { RequestSavingGraph graph = new RequestSavingGraph(DIAMOND_GRAPH); Iterable<Character> result = Traverser.forGraph(graph).breadthFirst(charactersOf("ab")); assertEqualCharNodes(Iterables.limit(result, 2), "ab");
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java
/** * null in dirty graph, actual * scope for conflict-resolved graph */ ArtifactScopeEnum scope; // ------------------------------------------------------------------------ /** * init graph */ public MetadataGraph(int nVertices) { init(nVertices, 2 * nVertices); } public MetadataGraph(int nVertices, int nEdges) {
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Oct 05 18:41:13 GMT 2023 - 13.1K bytes - Viewed (0) -
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) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
assertThat(graph.nodes()).containsExactly(N1, N5, N4, N2, N3).inOrder(); assertThat(graph.adjacentNodes(N1)).containsExactly(N4, N5); assertThat(graph.adjacentNodes(N2)).containsExactly(N3); assertThat(graph.adjacentNodes(N3)).containsExactly(N2); assertThat(graph.adjacentNodes(N4)).containsExactly(N1); assertThat(graph.adjacentNodes(N5)).containsExactly(N1); } @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
putEdge(N1, N1); assertThat(graph.degree(N1)).isEqualTo(2); putEdge(N1, N2); assertThat(graph.degree(N1)).isEqualTo(3); } @Test public void inDegree_selfLoop() { assume().that(graph.allowsSelfLoops()).isTrue(); putEdge(N1, N1); assertThat(graph.inDegree(N1)).isEqualTo(1); putEdge(N4, N1); assertThat(graph.inDegree(N1)).isEqualTo(2); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
* limitations under the License. */ package com.google.common.graph; import static com.google.common.graph.TestUtil.assertEdgeNotInGraphErrorMessage; import static com.google.common.graph.TestUtil.assertEdgeRemovedFromGraphErrorMessage; import static com.google.common.graph.TestUtil.assertNodeNotInGraphErrorMessage; import static com.google.common.graph.TestUtil.assertNodeRemovedFromGraphErrorMessage;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 33K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
* limitations under the License. */ package com.google.common.graph; import static com.google.common.graph.TestUtil.assertEdgeNotInGraphErrorMessage; import static com.google.common.graph.TestUtil.assertEdgeRemovedFromGraphErrorMessage; import static com.google.common.graph.TestUtil.assertNodeNotInGraphErrorMessage; import static com.google.common.graph.TestUtil.assertNodeRemovedFromGraphErrorMessage;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 32.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
assertThat(graph.predecessors(node)).hasSize(graph.inDegree(node)); assertThat(graph.successors(node)).hasSize(graph.outDegree(node)); } else { int selfLoopCount = graph.adjacentNodes(node).contains(node) ? 1 : 0; assertThat(graph.degree(node)).isEqualTo(graph.adjacentNodes(node).size() + selfLoopCount);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0)