addEdge - Code Search

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);

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Thu Jun 22 19:09:27 GMT 2017

- 5.9K bytes

- Viewed (0)

github.com/apache/maven

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,

Java

- Registered: Sun Apr 21 03:35:09 GMT 2024

- Last Modified: Fri Sep 22 06:02:04 GMT 2023

- 10.3K bytes

- Viewed (0)

github.com/google/guava

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");

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Sun May 05 18:02:35 GMT 2019

- 5.5K bytes

- Viewed (0)

github.com/google/guava

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

      network.addEdge(1, 2, "1-2a");
      network.addEdge(1, 2, "1-2b");
    }
    assertThat(hasCycle(directedNetwork)).isFalse();
    assertThat(hasCycle(undirectedNetwork)).isTrue(); // cyclic in undirected case
  }

  @Test
  public void hasCycle_cyclicMultigraph() {
    for (MutableNetwork<Integer, String> network : networksToTest) {
      network.addEdge(1, 2, "1-2a");

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Wed Sep 07 15:09:01 GMT 2016

- 5.7K bytes

- Viewed (0)

github.com/google/guava

android/guava/src/com/google/common/graph/NetworkBuilder.java

 * flightNetwork.addEdge("LAX", "ATL", 3025);
 * flightNetwork.addEdge("LAX", "ATL", 1598);
 * flightNetwork.addEdge("ATL", "LAX", 2450);
 *
 * // Building a immutable network
 * ImmutableNetwork<String, Integer> immutableNetwork =
 *     NetworkBuilder.directed()
 *         .allowsParallelEdges(true)
 *         .<String, Integer>immutable()
 *         .addEdge("LAX", "ATL", 3025)

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Fri Jun 03 01:21:31 GMT 2022

- 7.4K 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);

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Wed Sep 06 17:04:31 GMT 2023

- 21.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

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Wed Sep 06 17:04:31 GMT 2023

- 19.3K 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);

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Wed Sep 06 17:04:31 GMT 2023

- 21.6K bytes

- Viewed (0)

github.com/google/guava

android/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);

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Wed Sep 06 17:04:31 GMT 2023

- 24.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);

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Thu Jun 22 19:09:27 GMT 2017

- 5.9K bytes

- Viewed (0)

Search Options