addEdge - Code Search

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 May 03 12:43:13 GMT 2024

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

- 21.2K 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 May 05 03:35:11 GMT 2024

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

- 10.3K 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 May 03 12:43:13 GMT 2024

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

- 24.8K 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

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

Java

- Registered: Fri May 03 12:43:13 GMT 2024

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

- 18.9K bytes

- Viewed (0)

github.com/google/guava

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

        NetworkBuilder.directed().allowsSelfLoops(true).build();
    directedNetwork.addNode(N0);
    directedNetwork.addEdge(N1, N2, E12);
    directedNetwork.addEdge(N2, N1, E21);
    directedNetwork.addEdge(N1, N3, E13);
    directedNetwork.addEdge(N4, N4, E44);
    containsExactlySanityCheck(
        directedNetwork.asGraph().edges(),
        EndpointPair.ordered(N1, N2),

Java

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

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

- 9.4K bytes

- Viewed (0)

github.com/google/guava

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

        NetworkBuilder.directed().allowsSelfLoops(true).build();
    directedNetwork.addNode(N0);
    directedNetwork.addEdge(N1, N2, E12);
    directedNetwork.addEdge(N2, N1, E21);
    directedNetwork.addEdge(N1, N3, E13);
    directedNetwork.addEdge(N4, N4, E44);
    containsExactlySanityCheck(
        directedNetwork.asGraph().edges(),
        EndpointPair.ordered(N1, N2),

Java

- Registered: Fri May 03 12:43:13 GMT 2024

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

- 9.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/apache/maven

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

Java

- Registered: Sun May 05 03:35:11 GMT 2024

- Last Modified: Thu Apr 25 05:46:50 GMT 2024

- 4.7K bytes

- Viewed (0)

github.com/google/guava

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

  }

  @Test
  public void adjacentEdges_bothEndpoints() {
    addEdge(N1, N2, E12);
    addEdge(N2, N3, E23);
    addEdge(N3, N1, E31);
    addEdge(N3, N4, E34);
    assertThat(network.adjacentEdges(E12)).containsExactly(E31, E23);
  }

  @Test
  public void adjacentEdges_noAdjacentEdges() {
    addEdge(N1, N2, E12);
    addEdge(N3, N4, E34);
    assertThat(network.adjacentEdges(E12)).isEmpty();
  }

Java

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

- Last Modified: Mon Jan 22 17:29:38 GMT 2024

- 33K bytes

- Viewed (0)

Search Options