Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for expectedNodeCount (0.06 sec)

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

       */
      public static <N> MutableGraph<N> inducedSubgraph(Graph<N> graph, Iterable<? extends N> nodes) {
        MutableGraph<N> subgraph =
            (nodes instanceof Collection)
                ? GraphBuilder.from(graph).expectedNodeCount(((Collection) nodes).size()).build()
                : GraphBuilder.from(graph).build();
        for (N node : nodes) {
          subgraph.addNode(node);
        }
        for (N node : subgraph.nodes()) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  2. guava/src/com/google/common/graph/Graphs.java

       */
      public static <N> MutableGraph<N> inducedSubgraph(Graph<N> graph, Iterable<? extends N> nodes) {
        MutableGraph<N> subgraph =
            (nodes instanceof Collection)
                ? GraphBuilder.from(graph).expectedNodeCount(((Collection) nodes).size()).build()
                : GraphBuilder.from(graph).build();
        for (N node : nodes) {
          subgraph.addNode(node);
        }
        for (N node : subgraph.nodes()) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 23.3K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/graph/GraphsTest.java

            .isEqualTo(ImmutableSet.of(E12, E12_A, E21));
      }
    
      @Test
      public void createDirected_expectedNodeCount() {
        MutableNetwork<Integer, String> directedGraph =
            NetworkBuilder.directed().expectedNodeCount(NODE_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)
Back to top