addEdge - Code Search

compat/maven-model-builder/src/main/java/org/apache/maven/model/building/DefaultTransformerContextBuilder.java

                    // gathered with problem collector
                }
                return null;
            }
        };
    }

    private boolean addEdge(Path from, Path p, DefaultModelProblemCollector problems) {
        try {
            dag.addEdge(from.toString(), p.toString());
            return true;
        } catch (Graph.CycleDetectedException e) {
            problems.add(new DefaultModelProblem(

Registered: Sun Nov 03 03:35:11 UTC 2024

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

- 9.1K bytes

- Viewed (0)

github.com/google/guava

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)

github.com/google/guava

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)

github.com/google/guava

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)

github.com/apache/maven

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)

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 Nov 03 03:35:11 UTC 2024

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

- 4.7K 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 Nov 01 12:43:10 UTC 2024

- Last Modified: Tue Jul 02 18:21:29 UTC 2024

- 18.9K bytes

- Viewed (0)

github.com/google/guava

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)

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 Nov 01 12:43:10 UTC 2024

- Last Modified: Wed Oct 16 17:21:56 UTC 2024

- 5.8K 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 Nov 01 12:43:10 UTC 2024

- Last Modified: Wed Oct 16 17:21:56 UTC 2024

- 5.8K bytes

- Viewed (0)

Search Options