Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 10 for addEdge (0.07 sec)

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

        addEdge(N1, N1, E11);
        addEdge(N1, N2, E12);
        assertThat(network.adjacentEdges(E11)).containsExactly(E12);
      }
    
      @Test
      public void edgesConnecting_selfLoop() {
        assume().that(network.allowsSelfLoops()).isTrue();
    
        addEdge(N1, N1, E11);
        assertThat(network.edgesConnecting(N1, N1)).containsExactly(E11);
        addEdge(N1, N2, E12);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 02 18:21:29 UTC 2024
    - 21.2K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java

        addEdge(N1, N1, E11);
        addEdge(N1, N2, E12);
        assertThat(network.adjacentEdges(E11)).containsExactly(E12);
      }
    
      @Test
      public void edgesConnecting_selfLoop() {
        assume().that(network.allowsSelfLoops()).isTrue();
    
        addEdge(N1, N1, E11);
        assertThat(network.edgesConnecting(N1, N1)).containsExactly(E11);
        addEdge(N1, N2, E12);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 02 18:21:29 UTC 2024
    - 20.8K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java

        addEdge(N1, N1, E11);
        addEdge(N1, N2, E12);
        assertThat(network.adjacentEdges(E11)).containsExactly(E12);
      }
    
      @Test
      public void edgesConnecting_selfLoop() {
        assume().that(network.allowsSelfLoops()).isTrue();
    
        addEdge(N1, N1, E11);
        assertThat(network.edgesConnecting(N1, N1)).containsExactly(E11);
        addEdge(N1, N2, E12);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 02 18:21:29 UTC 2024
    - 18.6K bytes
    - Viewed (0)
  4. impl/maven-core/src/main/java/org/apache/maven/internal/impl/DefaultLifecycleRegistry.java

            Graph.Vertex ep3 = graph.addVertex("$$$" + phase.name());
            graph.addEdge(ep0, ep1);
            graph.addEdge(ep1, ep2);
            graph.addEdge(ep2, ep3);
            if (before != null) {
                graph.addEdge(before, ep0);
            }
            if (after != null) {
                graph.addEdge(ep3, after);
            }
            phase.links().forEach(link -> {
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 19.4K bytes
    - Viewed (0)
  5. 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();
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Jan 22 17:29:38 UTC 2024
    - 32.7K bytes
    - Viewed (0)
  6. guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java

        addEdge(N1, N1, E11);
        addEdge(N1, N2, E12);
        assertThat(network.adjacentNodes(N1)).containsExactly(N1, N2);
      }
    
      @Test
      public void adjacentEdges_selfLoop() {
        assume().that(network.allowsSelfLoops()).isTrue();
    
        addEdge(N1, N1, E11);
        addEdge(N1, N2, E12);
        assertThat(network.adjacentEdges(E11)).containsExactly(E12);
      }
    
      @Test
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 02 18:21:29 UTC 2024
    - 18.9K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/graph/GraphsTest.java

        directedGraph.addEdge(N1, N2, E12);
        directedGraph.addEdge(N1, N2, E12_A);
        directedGraph.addEdge(N1, N1, E11);
        directedGraph.addEdge(N3, N4, E34);
    
        MutableNetwork<Integer, String> expectedTranspose =
            NetworkBuilder.directed().allowsParallelEdges(true).allowsSelfLoops(true).build();
        expectedTranspose.addEdge(N3, N1, E13);
        expectedTranspose.addEdge(N1, N3, E31);
        expectedTranspose.addEdge(N2, N1, E12);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 02 18:21:29 UTC 2024
    - 24.7K bytes
    - Viewed (0)
  8. compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java

            {
                ArtifactMetadata md = node.getMd();
                MetadataGraphEdge e =
                        new MetadataGraphEdge(md.version, md.resolved, md.artifactScope, md.artifactUri, depth, pomOrder);
                addEdge(parentVertex, vertex, e);
            } else {
                entry = vertex;
            }
    
            MetadataTreeNode[] kids = node.getChildren();
            if (kids == null || kids.length < 1) {
                return;
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 13.1K bytes
    - Viewed (0)
  9. android/guava-tests/test/com/google/common/graph/TraverserTest.java

        MutableNetwork<String, Integer> network = NetworkBuilder.directed().build();
        network.addEdge("a", "b", 11);
    
        Traverser.forTree(network); // Does not throw
      }
    
      @Test
      public void forTree_withUndirectedNetwork_throws() throws Exception {
        MutableNetwork<String, Integer> network = NetworkBuilder.undirected().build();
        network.addEdge("a", "b", 11);
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Sep 06 17:04:31 UTC 2023
    - 47.5K bytes
    - Viewed (0)
  10. guava-tests/test/com/google/common/graph/TraverserTest.java

        MutableNetwork<String, Integer> network = NetworkBuilder.directed().build();
        network.addEdge("a", "b", 11);
    
        Traverser.forTree(network); // Does not throw
      }
    
      @Test
      public void forTree_withUndirectedNetwork_throws() throws Exception {
        MutableNetwork<String, Integer> network = NetworkBuilder.undirected().build();
        network.addEdge("a", "b", 11);
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Sep 06 17:04:31 UTC 2023
    - 47.5K bytes
    - Viewed (0)
Back to top