- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 187 for edges (0.17 sec)
-
android/guava/src/com/google/common/graph/PredecessorsFunction.java
@Beta @DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges") @ElementTypesAreNonnullByDefault public interface PredecessorsFunction<N> { /** * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing * {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphsTest.java
assertThat(e.getMessage()).contains(ERROR_PARALLEL_EDGE); e = assertThrows(IllegalArgumentException.class, () -> undirectedGraph.addEdge(N2, N1, E21)); assertThat(e.getMessage()).contains(ERROR_PARALLEL_EDGE); // By default, self-loop edges are not allowed. e = assertThrows(IllegalArgumentException.class, () -> undirectedGraph.addEdge(N1, N1, E11));
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/AbstractGraphTest.java
assertThat(graph.hasEdgeConnecting(endpoints.nodeU(), endpoints.nodeV())).isTrue(); } } } sanityCheckSet(graph.edges()); assertThat(graph.edges()).doesNotContain(EndpointPair.of(graph, new Object(), new Object())); assertThat(graph.edges()).isEqualTo(allEndpointPairs); } /** * Verifies that the {@code Set} returned by {@code nodes} has the expected mutability property
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
ImmutableMultimap.Builder<Character, Character> graphMapBuilder = ImmutableMultimap.builder(); for (String edge : edges) { checkArgument( edge.length() == 2, "Expecting each edge to consist of 2 characters but got %s", edge); char node1 = edge.charAt(0); char node2 = edge.charAt(1); graphMapBuilder.put(node1, node2);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ImmutableNetworkTest.java
assertThat(network.edges()).isEmpty(); } @Test public void immutableNetworkBuilder_putEdgeFromNodes() { ImmutableNetwork<String, Integer> network = NetworkBuilder.directed().<String, Integer>immutable().addEdge("A", "B", 10).build(); assertThat(network.nodes()).containsExactly("A", "B"); assertThat(network.edges()).containsExactly(10);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sun May 05 18:02:35 GMT 2019 - 5.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingValueGraph.java
@Override public Set<N> nodes() { return delegate().nodes(); } /** * Defer to {@link AbstractValueGraph#edges()} (based on {@link #successors(Object)}) for full * edges() implementation. */ @Override protected long edgeCount() { return delegate().edges().size(); } @Override public boolean isDirected() { return delegate().isDirected(); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
ImmutableMultimap.Builder<Character, Character> graphMapBuilder = ImmutableMultimap.builder(); for (String edge : edges) { checkArgument( edge.length() == 2, "Expecting each edge to consist of 2 characters but got %s", edge); char node1 = edge.charAt(0); char node2 = edge.charAt(1); graphMapBuilder.put(node1, node2);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableValueGraph.java
* * @return the value previously associated with the edge connecting {@code nodeU} to {@code * nodeV}, or null if there was no such edge. * @throws IllegalArgumentException if the introduction of the edge would violate {@link * #allowsSelfLoops()} */ @CanIgnoreReturnValue @CheckForNull V putEdgeValue(N nodeU, N nodeV, V value); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPairIterator.java
import java.util.Iterator; import java.util.Set; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A class to facilitate the set returned by {@link Graph#edges()}. * * @author James Sexton */ @ElementTypesAreNonnullByDefault abstract class EndpointPairIterator<N> extends AbstractIterator<EndpointPair<N>> { private final BaseGraph<N> graph;
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/util/concurrent/CycleDetectingLockFactory.java
* locks---to each of the acquired locks, an edge from the soon-to-be-acquired lock is either * verified or created. * <li>If a new edge needs to be created, the outgoing edges of the acquired locks are traversed * to check for a cycle that reaches the lock to be acquired. If no cycle is detected, a new * "safe" edge is created. * <li>If a cycle is detected, an "unsafe" (cyclic) edge is created to represent a potential
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0)