addEdge - Code Search

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)

github.com/apache/maven

compat/maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultClasspathTransformationTestType.java

        // v1-->v2
        graph.addEdge(v1, v2, new MetadataGraphEdge("1.1", true, null, null, 2, 1));
        graph.addEdge(v1, v2, new MetadataGraphEdge("1.2", true, null, null, 2, 2));

        // v1-->v3
        graph.addEdge(v1, v3, new MetadataGraphEdge("1.1", true, null, null, 2, 1));
        graph.addEdge(v1, v3, new MetadataGraphEdge("1.2", true, null, null, 4, 2));

        // v3-->v4

Registered: Sun Dec 28 03:35:09 UTC 2025

- Last Modified: Fri Oct 25 12:31:46 UTC 2024

- 4.7K bytes

- Viewed (0)

github.com/apache/maven

impl/maven-core/src/main/java/org/apache/maven/project/ProjectSorter.java

                if (vertex != null) {
                    addEdge(projectVertex, vertex, project, projectMap, force, safe);
                }
            } else {
                for (Vertex vertex : vertices.values()) {
                    addEdge(projectVertex, vertex, project, projectMap, force, safe);
                }
            }
        }
    }

    private void addEdge(
            Vertex fromVertex,

Registered: Sun Dec 28 03:35:09 UTC 2025

- Last Modified: Fri Oct 25 12:31:46 UTC 2024

- 10.3K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/test/com/google/common/graph/ElementOrderTest.java

    graph.addNode(3);
    graph.addNode(1);
    graph.addNode(4);
  }

  private static void addEdges(MutableNetwork<Integer, String> network) {
    network.addEdge(3, 1, "i");
    network.addEdge(1, 4, "e");
    network.addEdge(4, 3, "p");
  }

  private static class NonComparableSuperClass {
    final Integer value;

    NonComparableSuperClass(Integer value) {

Registered: Fri Dec 26 12:43:10 UTC 2025

- Last Modified: Thu Dec 19 18:03:30 UTC 2024

- 8.1K bytes

- Viewed (0)

github.com/apache/maven

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)

github.com/apache/maven

compat/maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolverTest.java

        // v1-->v2
        graph.addEdge(v1, v2, new MetadataGraphEdge("1.1", true, null, null, 2, 1));
        graph.addEdge(v1, v2, new MetadataGraphEdge("1.2", true, null, null, 2, 2));

        // v1-->v3
        graph.addEdge(v1, v3, new MetadataGraphEdge("1.1", true, null, null, 2, 1));
        graph.addEdge(v1, v3, new MetadataGraphEdge("1.2", true, null, null, 4, 2));

        // v3-->v4

Registered: Sun Dec 28 03:35:09 UTC 2025

- Last Modified: Fri Oct 25 12:31:46 UTC 2024

- 8.1K bytes

- Viewed (0)

github.com/apache/maven

compat/maven-model-builder/src/test/java/org/apache/maven/model/building/GraphTest.java

@Deprecated
public class GraphTest {

    @Test
    void testCycle() throws Graph.CycleDetectedException {
        Graph graph = new Graph();
        graph.addEdge("a1", "a2");
        assertThrows(Graph.CycleDetectedException.class, () -> graph.addEdge("a2", "a1"));
    }

    @Test
    public void testPerf() throws IOException {
        List<String[]> data = new ArrayList<>();
        String k = null;

Registered: Sun Dec 28 03:35:09 UTC 2025

- Last Modified: Fri Mar 21 04:56:21 UTC 2025

- 2K bytes

- Viewed (0)

github.com/google/guava

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)

github.com/google/guava

android/guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java

    // for ug1, add e12 first, then e12_a
    g1.addEdge(N1, N2, E12);
    g1.addEdge(N1, N2, E12_A);

    // for ug2, add e12_a first, then e12
    g2.addEdge(N1, N2, E12_A);
    g2.addEdge(N1, N2, E12);

    assertThat(g1).isEqualTo(g2);
  }

  @Test
  public void equivalent_edgeDirectionsDiffer() {
    network.addEdge(N1, N2, E12);

Registered: Fri Dec 26 12:43:10 UTC 2025

- Last Modified: Thu Dec 19 18:03:30 UTC 2024

- 5.9K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java

    // for ug1, add e12 first, then e12_a
    g1.addEdge(N1, N2, E12);
    g1.addEdge(N1, N2, E12_A);

    // for ug2, add e12_a first, then e12
    g2.addEdge(N1, N2, E12_A);
    g2.addEdge(N1, N2, E12);

    assertThat(g1).isEqualTo(g2);
  }

  @Test
  public void equivalent_edgeDirectionsDiffer() {
    network.addEdge(N1, N2, E12);

Registered: Fri Dec 26 12:43:10 UTC 2025

- Last Modified: Thu Dec 19 18:03:30 UTC 2024

- 5.9K bytes

- Viewed (0)

Search Options