- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 97 for edges (0.14 sec)
-
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
assertThat(graph.nodes()).hasSize(NUM_NODES); assertThat(graph.edges()).hasSize(NUM_EDGES); AbstractGraphTest.validateGraph(graph); Collections.shuffle(edgeList, gen); int numEdgesToRemove = gen.nextInt(NUM_EDGES); for (int i = 0; i < numEdgesToRemove; ++i) { EndpointPair<Integer> edge = edgeList.get(i);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/NetworkMutationTest.java
ArrayList<Object> edgeList = new ArrayList<>(network.edges()); assertThat(network.nodes()).hasSize(NUM_NODES); assertThat(network.edges()).hasSize(NUM_EDGES); AbstractNetworkTest.validateNetwork(network); Collections.shuffle(edgeList, gen); int numEdgesToRemove = gen.nextInt(NUM_EDGES); for (int i = 0; i < numEdgesToRemove; ++i) { Object edge = edgeList.get(i);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkBuilder.java
* user-defined properties. * * <p>A {@code Network} built by this class has the following default properties: * * <ul> * <li>does not allow parallel edges * <li>does not allow self-loops * <li>orders {@link Network#nodes()} and {@link Network#edges()} in the order in which the * elements were added (insertion order) * </ul> *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MultiEdgesConnecting.java
import javax.annotation.CheckForNull; /** * A class to represent the set of edges connecting an (implicit) origin node to a target node. * * <p>The {@link #outEdgeToNode} map allows this class to work on networks with parallel edges. See * {@link EdgesConnecting} for a class that is more efficient but forbids parallel edges. * * @author James Sexton * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 2.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractDirectedNetworkConnections.java
} @Override public N adjacentNode(E edge) { // Since the reference node is defined to be 'source' for directed graphs, // we can assume this edge lives in the set of outgoing edges. // (We're relying on callers to call this method only with an edge that's in the graph.) return requireNonNull(outEdgeMap.get(edge)); } @Override public N removeInEdge(E edge, boolean isSelfLoop) { if (isSelfLoop) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.5K bytes - Viewed (0) -
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 19 12:43:09 GMT 2024 - Last Modified: Sun May 05 18:02:35 GMT 2019 - 5.5K bytes - Viewed (0) -
android/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 May 03 12:43:13 GMT 2024 - Last Modified: Thu Jan 09 20:24:43 GMT 2020 - 6.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ElementOrderTest.java
assertThat(network.edgeOrder()) .isEqualTo(ElementOrder.sorted(Ordering.<String>natural().reverse())); assertThat(network.edges()).containsExactly("p", "i", "e").inOrder(); assertThat(network.nodeOrder()).isEqualTo(ElementOrder.insertion()); // default } // Combined node and edge order tests @Test public void nodeOrderUnorderedAndEdgesSorted() { MutableNetwork<Integer, String> network =
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
android/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 May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K 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)