- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 241 for graaph (0.16 sec)
-
android/guava/src/com/google/common/graph/ValueGraphBuilder.java
* * <pre>{@code * // Building a mutable value graph * MutableValueGraph<String, Double> graph = * ValueGraphBuilder.undirected().allowsSelfLoops(true).build(); * graph.putEdgeValue("San Francisco", "San Francisco", 0.0); * graph.putEdgeValue("San Jose", "San Jose", 0.0); * graph.putEdgeValue("San Francisco", "San Jose", 48.4); * * // Building an immutable value graph * ImmutableValueGraph<String, Double> immutableGraph =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 8K 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) -
android/guava/src/com/google/common/graph/StandardNetwork.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.graph.GraphConstants.DEFAULT_EDGE_COUNT; import static com.google.common.graph.GraphConstants.DEFAULT_NODE_COUNT; import static com.google.common.graph.GraphConstants.EDGE_NOT_IN_GRAPH;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPairIterator.java
static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) { return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph); } private EndpointPairIterator(BaseGraph<N> graph) { this.graph = graph; this.nodeIterator = graph.nodes().iterator(); } /** * Called after {@link #successorIterator} is exhausted. Advances {@link #node} to the next node
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jul 09 17:31:04 GMT 2021 - 5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableGraph.java
@SuppressWarnings("Immutable") // The backing graph must be immutable. private final BaseGraph<N> backingGraph; ImmutableGraph(BaseGraph<N> backingGraph) { this.backingGraph = backingGraph; } /** Returns an immutable copy of {@code graph}. */ public static <N> ImmutableGraph<N> copyOf(Graph<N> graph) { return (graph instanceof ImmutableGraph) ? (ImmutableGraph<N>) graph : new ImmutableGraph<N>(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java
// In this case the graphs are considered equivalent; the property differences are irrelevant. @Test public void equivalent_propertiesDiffer() { graph.putEdge(N1, N2); MutableGraph<Integer> g2 = GraphBuilder.from(graph).allowsSelfLoops(!graph.allowsSelfLoops()).build(); g2.putEdge(N1, N2); assertThat(graph).isEqualTo(g2); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 4.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java
// In this case the graphs are considered equivalent; the property differences are irrelevant. @Test public void equivalent_propertiesDiffer() { graph.putEdge(N1, N2); MutableGraph<Integer> g2 = GraphBuilder.from(graph).allowsSelfLoops(!graph.allowsSelfLoops()).build(); g2.putEdge(N1, N2); assertThat(graph).isEqualTo(g2); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 4.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
*/ package com.google.common.graph; import com.google.common.annotations.Beta; import com.google.errorprone.annotations.DoNotMock; /** * A functional interface for <a * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data. * * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.3K bytes - Viewed (0) -
tensorflow/c/eager/c_api_unified_experimental_internal.h
}; namespace tracing { // ============================================================================= // Implementation detail for the unified execution APIs for Eager and tracing // backends (graph/MLIR). // // This defines a set of abstract classes that are intended to provide the // functionality of the opaque C types exposed in the public APIs defined in the // `c_api_unified_experimental.h` header.
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Fri Nov 13 22:20:40 GMT 2020 - 5.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/UndirectedGraphConnections.java
* See the License for the specific language governing permissions and * limitations under the License. */ package com.google.common.graph; import static com.google.common.base.Preconditions.checkNotNull; import static com.google.common.graph.GraphConstants.INNER_CAPACITY; import static com.google.common.graph.GraphConstants.INNER_LOAD_FACTOR; import com.google.common.collect.ImmutableMap; import com.google.common.collect.Iterators;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.3K bytes - Viewed (0)