Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 21 for n3 (0.03 sec)

  1. guava-tests/test/com/google/common/graph/GraphsTest.java

        expectedClosure.putEdge(N1, N3);
        expectedClosure.putEdge(N1, N4);
        expectedClosure.putEdge(N2, N1);
        expectedClosure.putEdge(N2, N2);
        expectedClosure.putEdge(N2, N3);
        expectedClosure.putEdge(N2, N4);
        expectedClosure.putEdge(N3, N1);
        expectedClosure.putEdge(N3, N2);
        expectedClosure.putEdge(N3, N3);
        expectedClosure.putEdge(N3, N4);
        expectedClosure.putEdge(N4, N1);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 02 18:21:29 UTC 2024
    - 24.7K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java

      @Test
      public void equivalent_connectionsDiffer() {
        network.addEdge(N1, N2, E12);
        network.addEdge(N1, N3, E13);
    
        MutableNetwork<Integer, String> g2 = createNetwork(edgeType);
        // connect E13 to N1 and N2, and E12 to N1 and N3 => not equivalent
        g2.addEdge(N1, N2, E13);
        g2.addEdge(N1, N3, E12);
    
        assertThat(network).isNotEqualTo(g2);
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 17:21:56 UTC 2024
    - 5.8K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java

      @Test
      public void equivalent_connectionsDiffer() {
        network.addEdge(N1, N2, E12);
        network.addEdge(N1, N3, E13);
    
        MutableNetwork<Integer, String> g2 = createNetwork(edgeType);
        // connect E13 to N1 and N2, and E12 to N1 and N3 => not equivalent
        g2.addEdge(N1, N2, E13);
        g2.addEdge(N1, N3, E12);
    
        assertThat(network).isNotEqualTo(g2);
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 17:21:56 UTC 2024
    - 5.8K bytes
    - Viewed (0)
  4. src/main/webapp/css/admin/bootstrap.min.css

    n2{margin-top:-.5rem!important}.mr-n2,.mx-n2{margin-right:-.5rem!important}.mb-n2,.my-n2{margin-bottom:-.5rem!important}.ml-n2,.mx-n2{margin-left:-.5rem!important}.m-n3{margin:-1rem!important}.mt-n3,.my-n3{margin-top:-1rem!important}.mr-n3,.mx-n3{margin-right:-1rem!important}.mb-n3,.my-n3{margin-bottom:-1rem!important}.ml-n3,.mx-n3{margin-left:-1rem!important}.m-n4{margin:-1.5rem!important}.mt-n4,.my-n4{margin-top:-1.5rem!important}.mr-n4,.mx-n4{margin-right:-1.5rem!important}.mb-n4,.my-n4{margi...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 158.5K bytes
    - Viewed (0)
  5. guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java

        assertTrue(graphAsMutableGraph.putEdge(N4, N1));
        assertTrue(graphAsMutableGraph.putEdge(N2, N3));
        assertThat(graph.nodes()).containsExactly(N1, N5, N4, N2, N3).inOrder();
        assertThat(graph.adjacentNodes(N1)).containsExactly(N4, N5);
        assertThat(graph.adjacentNodes(N2)).containsExactly(N3);
        assertThat(graph.adjacentNodes(N3)).containsExactly(N2);
        assertThat(graph.adjacentNodes(N4)).containsExactly(N1);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 02 18:21:29 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  6. android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java

        assertTrue(networkAsMutableNetwork.addEdge(N2, N3, E23));
        assertThat(network.nodes()).containsExactly(N1, N5, N4, N2, N3);
        assertThat(network.edges()).containsExactly(E15, E41, E23);
        assertThat(network.edgesConnecting(N1, N5)).containsExactly(E15);
        assertThat(network.edgesConnecting(N4, N1)).containsExactly(E41);
        assertThat(network.edgesConnecting(N2, N3)).containsExactly(E23);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 02 18:21:29 UTC 2024
    - 20.8K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java

        assertTrue(networkAsMutableNetwork.addEdge(N2, N3, E23));
        assertThat(network.nodes()).containsExactly(N1, N5, N4, N2, N3);
        assertThat(network.edges()).containsExactly(E15, E41, E23);
        assertThat(network.edgesConnecting(N1, N5)).containsExactly(E15);
        assertThat(network.edgesConnecting(N4, N1)).containsExactly(E41);
        assertThat(network.edgesConnecting(N2, N3)).containsExactly(E23);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 02 18:21:29 UTC 2024
    - 21.2K bytes
    - Viewed (0)
  8. android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java

      @Test
      public void adjacentEdges_bothEndpoints() {
        addEdge(N1, N2, E12);
        addEdge(N2, N3, E23);
        addEdge(N3, N1, E31);
        addEdge(N3, N4, E34);
        assertThat(network.adjacentEdges(E12)).containsExactly(E31, E23);
      }
    
      @Test
      public void adjacentEdges_noAdjacentEdges() {
        addEdge(N1, N2, E12);
        addEdge(N3, N4, E34);
        assertThat(network.adjacentEdges(E12)).isEmpty();
      }
    
      @Test
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Jan 22 17:29:38 UTC 2024
    - 32.7K bytes
    - Viewed (0)
  9. android/guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java

        MutableGraph<Integer> g1 = builder.build();
        MutableGraph<Integer> g2 = builder.build();
    
        // for g1, add 1->2 first, then 3->1
        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);
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 17:21:56 UTC 2024
    - 4.6K bytes
    - Viewed (0)
  10. guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java

        MutableGraph<Integer> g1 = builder.build();
        MutableGraph<Integer> g2 = builder.build();
    
        // for g1, add 1->2 first, then 3->1
        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);
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 17:21:56 UTC 2024
    - 4.6K bytes
    - Viewed (0)
Back to top