Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 16 of 16 for addEdges (0.04 sec)

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

        return networkBuilder.build();
      }
    
      @Override
      void addNode(Integer n) {
        networkBuilder.addNode(n);
        network = networkBuilder.build();
      }
    
      @Override
      void addEdge(Integer n1, Integer n2, String e) {
        networkBuilder.addEdge(n1, n2, e);
        network = networkBuilder.build();
      }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 2.9K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java

          ArrayList<Integer> nodeList = new ArrayList<>(network.nodes());
          for (int i = 0; i < NUM_EDGES; ++i) {
            // Parallel edges are allowed, so this should always succeed.
            assertThat(
                    network.addEdge(
                        getRandomElement(nodeList, gen), getRandomElement(nodeList, gen), new Object()))
                .isTrue();
          }
          ArrayList<Object> edgeList = new ArrayList<>(network.edges());
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 4.6K bytes
    - Viewed (0)
  3. 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. */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  4. 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. */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 23.3K bytes
    - Viewed (0)
  5. 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);
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 47.5K bytes
    - Viewed (0)
  6. 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);
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 47.5K bytes
    - Viewed (0)
Back to top