- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 126 for Geddes (0.23 sec)
-
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
// Ideally, the ordering in test should never be updated. @Test public void stableIncidentEdgeOrder_edges_returnsInStableOrder() { assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); populateStarShapedGraph(); assertThat(graph.edges()) .containsExactly( EndpointPair.ordered(2, 1), EndpointPair.ordered(1, 4),
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
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) -
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/StandardImmutableGraphAdditionalTest.java
assertThat(graph.nodes()).containsExactly("A"); assertThat(graph.edges()).isEmpty(); } @Test public void immutableGraphBuilder_putEdgeFromNodes() { ImmutableGraph<String> graph = GraphBuilder.directed().<String>immutable().putEdge("A", "B").build(); assertThat(graph.nodes()).containsExactly("A", "B"); assertThat(graph.edges()).containsExactly(EndpointPair.ordered("A", "B")); } @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jan 09 20:24:43 GMT 2020 - 4.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.
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) -
guava-tests/test/com/google/common/graph/GraphsTest.java
assertThat(directedGraph.nodes()).isEmpty(); assertThat(directedGraph.edges()).isEmpty(); assertThat(directedGraph.addEdge(N1, N2, E12)).isTrue(); assertThat(directedGraph.edgesConnecting(N1, N2)).isEqualTo(ImmutableSet.of(E12)); assertThat(directedGraph.edgesConnecting(N2, N1)).isEmpty(); // By default, parallel edges are not allowed. IllegalArgumentException e =
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 May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ImmutableValueGraphTest.java
ImmutableValueGraph<String, Integer> graph = ValueGraphBuilder.directed().<String, Integer>immutable().addNode("A").build(); assertThat(graph.nodes()).containsExactly("A"); assertThat(graph.edges()).isEmpty(); } @Test public void immutableValueGraphBuilder_putEdgeFromNodes() { ImmutableValueGraph<String, Integer> graph = ValueGraphBuilder.directed()
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Jan 09 20:24:43 GMT 2020 - 6.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/UndirectedMultiNetworkConnections.java
import java.util.HashMap; import java.util.Map; import java.util.Set; import javax.annotation.CheckForNull; /** * An implementation of {@link NetworkConnections} for undirected networks with parallel edges. * * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault final class UndirectedMultiNetworkConnections<N, E>
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
// Ideally, the ordering in test should never be updated. @Test public void stableIncidentEdgeOrder_edges_returnsInStableOrder() { assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); populateTShapedGraph(); assertThat(graph.edges()) .containsExactly( EndpointPair.unordered(1, 2), EndpointPair.unordered(1, 4),
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K bytes - Viewed (0)