Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for addEdges (0.03 sec)

  1. android/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();
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 32.7K bytes
    - Viewed (0)
  2. 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)
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 7.4K 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