- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 340 for Graph (0.13 sec)
-
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 Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
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/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;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.5K bytes - Viewed (0) -
tensorflow/c/c_api.cc
// it. status->status = graph::ValidateGraphHasNoCycle(session->graph->graph); if (!status->status.ok()) { session->graph->mu.unlock(); return false; } GraphDef graph_def; *graph_def.mutable_versions() = graph.versions(); // Fill graph_def with nodes with ids in the range
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 102.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableValueGraph.java
private ImmutableValueGraph(ValueGraph<N, V> graph) { super(ValueGraphBuilder.from(graph), getNodeConnections(graph), graph.edges().size()); } /** Returns an immutable copy of {@code graph}. */ public static <N, V> ImmutableValueGraph<N, V> copyOf(ValueGraph<N, V> graph) { return (graph instanceof ImmutableValueGraph) ? (ImmutableValueGraph<N, V>) graph : new ImmutableValueGraph<N, V>(graph); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/StandardImmutableUndirectedGraphTest.java
this.allowsSelfLoops = allowsSelfLoops; } @Override public Graph<Integer> createGraph() { graphBuilder = GraphBuilder.undirected().allowsSelfLoops(allowsSelfLoops).immutable(); return graphBuilder.build(); } @Override final void addNode(Integer n) { graphBuilder.addNode(n); graph = graphBuilder.build(); } @Override final void putEdge(Integer n1, Integer n2) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Mar 10 17:54:18 GMT 2020 - 1.8K 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) -
android/guava/src/com/google/common/graph/BaseGraph.java
Set<N> nodes(); /** Returns all edges in this graph. */ Set<EndpointPair<N>> edges(); // // Graph properties // /** * Returns true if the edges in this graph are directed. Directed edges connect a {@link * EndpointPair#source() source node} to a {@link EndpointPair#target() target node}, while * undirected edges connect a pair of nodes to each other.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 8.8K bytes - Viewed (0)