- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 41 for N1 (0.13 sec)
-
android/guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
network.addEdge(N1, N1, E11); MutableNetwork<Integer, String> g2 = createNetwork(oppositeType(edgeType)); g2.addEdge(N1, N1, E11); assertThat(network).isNotEqualTo(g2); } // Node/edge sets are the same, but node/edge connections differ. @Test public void equivalent_connectionsDiffer() { network.addEdge(N1, N2, E12); network.addEdge(N1, N3, E13);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 5.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/DefaultNetworkImplementationsTest.java
assertThat(networkForTest.edgesConnecting(N1, N1)).containsExactly(E11); network.addEdge(N1, N2, E12); assertThat(networkForTest.edgesConnecting(N1, N2)).containsExactly(E12); assertThat(networkForTest.edgesConnecting(N1, N1)).containsExactly(E11); } @Test public void edgesConnecting_parallelEdges() { network.addEdge(N1, N2, E12); network.addEdge(N1, N2, E12_A); network.addEdge(N2, N1, E21);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 7.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/DefaultNetworkImplementationsTest.java
assertThat(networkForTest.edgesConnecting(N1, N1)).containsExactly(E11); network.addEdge(N1, N2, E12); assertThat(networkForTest.edgesConnecting(N1, N2)).containsExactly(E12); assertThat(networkForTest.edgesConnecting(N1, N1)).containsExactly(E11); } @Test public void edgesConnecting_parallelEdges() { network.addEdge(N1, N2, E12); network.addEdge(N1, N2, E12_A); network.addEdge(N2, N1, E21);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 7.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java
g1.putEdge(N1, N2); g1.putEdge(N3, N1); // for g2, add 3->1 first, then 1->2 g2.putEdge(N3, N1); g2.putEdge(N1, N2); assertThat(g1).isEqualTo(g2); } @Test public void equivalent_edgeDirectionsDiffer() { graph.putEdge(N1, N2); MutableGraph<Integer> g2 = createGraph(edgeType); g2.putEdge(N2, N1); switch (edgeType) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 4.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkBuilder.java
public <N1 extends N, E1 extends E> MutableNetwork<N1, E1> build() { return new StandardMutableNetwork<>(this); } @SuppressWarnings("unchecked") private <N1 extends N, E1 extends E> NetworkBuilder<N1, E1> cast() { return (NetworkBuilder<N1, E1>) this; }
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/GraphBuilder.java
* Specifies the order of iteration for the elements of {@link Graph#nodes()}. * * <p>The default value is {@link ElementOrder#insertion() insertion order}. */ public <N1 extends N> GraphBuilder<N1> nodeOrder(ElementOrder<N1> nodeOrder) { GraphBuilder<N1> newBuilder = cast(); newBuilder.nodeOrder = checkNotNull(nodeOrder); return newBuilder; } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/EndpointPairTest.java
directedGraph.putEdge(N1, N2); containsExactlySanityCheck(edges, EndpointPair.ordered(N1, N2)); directedGraph.putEdge(N2, N1); containsExactlySanityCheck(edges, EndpointPair.ordered(N1, N2), EndpointPair.ordered(N2, N1)); directedGraph.removeEdge(N1, N2); directedGraph.removeEdge(N2, N1); containsExactlySanityCheck(edges); assertThrows(
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 9.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/EndpointPairTest.java
directedGraph.putEdge(N1, N2); containsExactlySanityCheck(edges, EndpointPair.ordered(N1, N2)); directedGraph.putEdge(N2, N1); containsExactlySanityCheck(edges, EndpointPair.ordered(N1, N2), EndpointPair.ordered(N2, N1)); directedGraph.removeEdge(N1, N2); directedGraph.removeEdge(N2, N1); containsExactlySanityCheck(edges); assertThrows(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 9.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPairIterator.java
* * <pre> * Nodes = {N1, N2, N3, N4} * N2 __ * / \ | | * N1----N3 N4__| * * Visited Nodes = {} * EndpointPair [N1, N2] - return * EndpointPair [N1, N3] - return * Visited Nodes = {N1} * EndpointPair [N2, N1] - skip * EndpointPair [N2, N3] - return * Visited Nodes = {N1, N2} * EndpointPair [N3, N1] - skip
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jul 09 17:31:04 GMT 2021 - 5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
network.addEdge(N1, N1, E11); MutableNetwork<Integer, String> g2 = createNetwork(oppositeType(edgeType)); g2.addEdge(N1, N1, E11); assertThat(network).isNotEqualTo(g2); } // Node/edge sets are the same, but node/edge connections differ. @Test public void equivalent_connectionsDiffer() { network.addEdge(N1, N2, E12); network.addEdge(N1, N3, E13);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 5.9K bytes - Viewed (0)