Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 8 of 8 for addEdge (0.2 seconds)

  2. 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);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 30 17:09:51 GMT 2025
    - 18.6K bytes
    - Click Count (0)
  3. 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);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 30 17:09:51 GMT 2025
    - 21.3K bytes
    - Click Count (0)
  4. 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
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 30 17:09:51 GMT 2025
    - 19K bytes
    - Click Count (0)
  5. github.com/apache/maven

    compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java 

            {
            ArtifactMetadata md = node.getMd();
            MetadataGraphEdge e =
                    new MetadataGraphEdge(md.version, md.resolved, md.artifactScope, md.artifactUri, depth, pomOrder);
            addEdge(parentVertex, vertex, e);
        } else {
            entry = vertex;
        }

        MetadataTreeNode[] kids = node.getChildren();
        if (kids == null || kids.length < 1) {
            return;
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Wed Jul 23 17:27:08 GMT 2025
    - 13K bytes
    - Click Count (0)
  6. 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);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Jan 09 23:46:06 GMT 2026
    - 30.1K bytes
    - Click Count (0)
  7. 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 -> {
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Mon Sep 29 14:45:25 GMT 2025
    - 20.1K bytes
    - Click Count (0)
  8. github.com/google/guava

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

          for (E edge : network.outEdges(node)) {
        N successorNode = network.incidentNodes(edge).adjacentNode(node);
        if (subgraph.nodes().contains(successorNode)) {
          subgraph.addEdge(node, successorNode, edge);
        }
      }
    }
    return subgraph;
  }

  /** Creates a mutable copy of {@code graph} with the same nodes and edges. */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 24.4K bytes
    - Click Count (0)
  9. github.com/google/guava

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

        MutableNetwork<String, Integer> network = NetworkBuilder.directed().build();
    network.addEdge("a", "b", 11);

    Traverser.forTree(network); // Does not throw
  }

  @Test
  public void forTree_withUndirectedNetwork_throws() throws Exception {
    MutableNetwork<String, Integer> network = NetworkBuilder.undirected().build();
    network.addEdge("a", "b", 11);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 30 17:09:51 GMT 2025
    - 47.4K bytes
    - Click Count (0)
Back to Top