- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 97 for edges (0.13 sec)
-
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) -
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/AbstractBaseGraph.java
@ElementTypesAreNonnullByDefault abstract class AbstractBaseGraph<N> implements BaseGraph<N> { /** * Returns the number of edges in this graph; used to calculate the size of {@link Graph#edges()}. * This implementation requires O(|N|) time. Classes extending this one may manually keep track of * the number of edges as the graph is updated, and override this method for better performance. */ protected long edgeCount() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 7.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableNetwork.java
// whatever ordering the network's edges do, so ImmutableSortedMap is unnecessary even if the // input edges are sorted. ImmutableMap.Builder<E, N> edgeToReferenceNode = ImmutableMap.builder(); for (E edge : network.edges()) { edgeToReferenceNode.put(edge, network.incidentNodes(edge).nodeU()); } return edgeToReferenceNode.buildOrThrow(); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 9.6K 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) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
if (connections == null) { return false; } if (allowsSelfLoops()) { // Remove self-loop (if any) first, so we don't get CME while removing incident edges. if (connections.removeSuccessor(node) != null) { connections.removePredecessor(node); --edgeCount; } } for (N successor : ImmutableList.copyOf(connections.successors())) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Oct 21 01:50:30 GMT 2023 - 6.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ValueGraphTest.java
Graph<Integer> asGraph = graph.asGraph(); AbstractGraphTest.validateGraph(asGraph); assertThat(graph.nodes()).isEqualTo(asGraph.nodes()); assertThat(graph.edges()).isEqualTo(asGraph.edges()); assertThat(graph.nodeOrder()).isEqualTo(asGraph.nodeOrder()); assertThat(graph.incidentEdgeOrder()).isEqualTo(asGraph.incidentEdgeOrder()); assertThat(graph.isDirected()).isEqualTo(asGraph.isDirected());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 18:35:19 GMT 2024 - 20K 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-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 May 03 12:43:13 GMT 2024 - Last Modified: Sun May 05 18:02:35 GMT 2019 - 5.5K bytes - Viewed (0)