addEdge - Code Search

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

        .edgeOrder(edgeOrder)
        .build();
  }

  @Override
  void addNode(Integer n) {
    networkAsMutableNetwork.addNode(n);
  }

  @Override
  void addEdge(Integer n1, Integer n2, String e) {
    networkAsMutableNetwork.addEdge(n1, n2, e);
  }

Java

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

- Last Modified: Thu Apr 09 17:01:22 GMT 2020

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

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

Java

- Registered: Sun Apr 28 03:35:10 GMT 2024

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

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

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

  @Test
  public void edgesConnecting_parallelEdges() {
    network.addEdge(N1, N2, E12);
    network.addEdge(N1, N2, E12_A);
    network.addEdge(N2, N1, E21);
    if (edgeType == EdgeType.DIRECTED) {
      assertThat(networkForTest.edgesConnecting(N1, N2)).containsExactly(E12, E12_A);
      assertThat(networkForTest.edgesConnecting(N2, N1)).containsExactly(E21);
    } else {

Java

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

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

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

github.com/google/guava

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

  @Test
  public void edgesConnecting_parallelEdges() {
    network.addEdge(N1, N2, E12);
    network.addEdge(N1, N2, E12_A);
    network.addEdge(N2, N1, E21);
    if (edgeType == EdgeType.DIRECTED) {
      assertThat(networkForTest.edgesConnecting(N1, N2)).containsExactly(E12, E12_A);
      assertThat(networkForTest.edgesConnecting(N2, N1)).containsExactly(E21);
    } else {

Java

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

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

- 7.4K 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/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 26 12:43:10 GMT 2024

- Last Modified: Mon Jun 19 21:11:54 GMT 2017

- 5.7K bytes

- Viewed (0)

Search Options