- Sort Score
- Result 10 results
- Languages All
Results 1 - 9 of 9 for reachableNodes (1.16 sec)
-
android/guava/src/com/google/common/graph/Graphs.java
for (N node : graph.nodes()) { if (!visitedNodes.contains(node)) { Set<N> reachableNodes = reachableNodes(graph, node); visitedNodes.addAll(reachableNodes); int pairwiseMatch = 1; // start at 1 to include self-loops for (N nodeU : reachableNodes) { for (N nodeV : Iterables.limit(reachableNodes, pairwiseMatch++)) { transitiveClosure.putEdge(nodeU, nodeV); }
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/GraphsBridgeMethods.java
public static <N> Graph<N> transitiveClosure(Graph<N> graph) { 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) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}. * * <p>Some algorithms that operate on a {@code SuccessorsFunction} may produce undesired results * if the returned {@link Iterable} contains duplicate elements. Implementations of such
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) -
guava-tests/test/com/google/common/graph/GraphsTest.java
*/ package com.google.common.graph; import static com.google.common.graph.Graphs.copyOf; import static com.google.common.graph.Graphs.inducedSubgraph; import static com.google.common.graph.Graphs.reachableNodes; import static com.google.common.graph.Graphs.transitiveClosure; import static com.google.common.graph.Graphs.transpose; import static com.google.common.truth.Truth.assertThat; import static org.junit.Assert.assertThrows;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 24.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphsTest.java
*/ package com.google.common.graph; import static com.google.common.graph.Graphs.copyOf; import static com.google.common.graph.Graphs.inducedSubgraph; import static com.google.common.graph.Graphs.reachableNodes; import static com.google.common.graph.Graphs.transitiveClosure; import static com.google.common.graph.Graphs.transpose; import static com.google.common.truth.Truth.assertThat; import static org.junit.Assert.assertThrows;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 24.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
* * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}. * * <p>If {@code node} is removed from the graph after this method is called, the {@code Set} * {@code view} returned by this method will be invalidated, and will throw {@code
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/ValueGraph.java
* * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}. * * <p>If {@code node} is removed from the graph after this method is called, the {@code Set} * {@code view} returned by this method will be invalidated, and will throw {@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
* * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}. * * <p>If {@code node} is removed from the graph after this method is called, the {@code Set} * {@code view} returned by this method will be invalidated, and will throw {@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}. * * <p>If {@code node} is removed from the network after this method is called, the {@code Set} * {@code view} returned by this method will be invalidated, and will throw {@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0)