Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for expectedEdgeCount (0.09 sec)

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

      }
    
      @Test
      public void createDirected_expectedEdgeCount() {
        MutableNetwork<Integer, String> directedGraph =
            NetworkBuilder.directed().expectedEdgeCount(EDGE_COUNT).build();
        assertThat(directedGraph.addEdge(N1, N2, E12)).isTrue();
        assertThat(directedGraph.edgesConnecting(N1, N2)).isEqualTo(ImmutableSet.of(E12));
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 24.6K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/graph/Graphs.java

      public static <N, E> MutableNetwork<N, E> copyOf(Network<N, E> network) {
        MutableNetwork<N, E> copy =
            NetworkBuilder.from(network)
                .expectedNodeCount(network.nodes().size())
                .expectedEdgeCount(network.edges().size())
                .build();
        for (N node : network.nodes()) {
          copy.addNode(node);
        }
        for (E edge : network.edges()) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  3. guava/src/com/google/common/graph/Graphs.java

      public static <N, E> MutableNetwork<N, E> copyOf(Network<N, E> network) {
        MutableNetwork<N, E> copy =
            NetworkBuilder.from(network)
                .expectedNodeCount(network.nodes().size())
                .expectedEdgeCount(network.edges().size())
                .build();
        for (N node : network.nodes()) {
          copy.addNode(node);
        }
        for (E edge : network.edges()) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 23.3K bytes
    - Viewed (0)
Back to top