Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for addEdge (0.03 sec)

  1. impl/maven-core/src/test/java/org/apache/maven/project/GraphTest.java

            Graph graph3 = new Graph();
            addEdge(graph3, "a", "b");
            addEdge(graph3, "b", "c");
            addEdge(graph3, "b", "d");
            addEdge(graph3, "a", "d");
    
            Graph graph4 = new Graph();
            addEdge(graph4, "a", "b");
            addEdge(graph4, "b", "c");
            addEdge(graph4, "b", "d");
            addEdge(graph4, "a", "d");
    Registered: Sun Dec 28 03:35:09 UTC 2025
    - Last Modified: Wed Sep 17 10:01:14 UTC 2025
    - 8.5K bytes
    - Viewed (0)
  2. impl/maven-core/src/main/java/org/apache/maven/internal/impl/DefaultLifecycleRegistry.java

            Graph.Vertex ep3 = graph.addVertex(AFTER + 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 Dec 28 03:35:09 UTC 2025
    - Last Modified: Mon Sep 29 14:45:25 UTC 2025
    - 20.1K bytes
    - Viewed (0)
  3. 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 Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Sep 30 17:09:51 UTC 2025
    - 19K bytes
    - Viewed (0)
  4. 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 Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Sep 30 17:09:51 UTC 2025
    - 30.1K bytes
    - Viewed (0)
  5. guava-tests/test/com/google/common/graph/ImmutableNetworkTest.java

      }
    
      @Test
      public void edgesConnecting_directed() {
        MutableNetwork<String, String> mutableNetwork =
            NetworkBuilder.directed().allowsSelfLoops(true).build();
        mutableNetwork.addEdge("A", "A", "AA");
        mutableNetwork.addEdge("A", "B", "AB");
        Network<String, String> network = ImmutableNetwork.copyOf(mutableNetwork);
    
        assertThat(network.edgesConnecting("A", "A")).containsExactly("AA");
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Sep 30 17:09:51 UTC 2025
    - 5.4K bytes
    - Viewed (0)
  6. 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 Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Sep 30 17:09:51 UTC 2025
    - 47.4K bytes
    - Viewed (2)
Back to top