Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for undirectedNetwork (0.08 sec)

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

        assertThat(hasCycle(undirectedNetwork)).isFalse();
      }
    
      @Test
      public void hasCycle_twoParallelEdges() {
        for (MutableNetwork<Integer, String> network : networksToTest) {
          network.addEdge(1, 2, "1-2a");
          network.addEdge(1, 2, "1-2b");
        }
        assertThat(hasCycle(directedNetwork)).isFalse();
        assertThat(hasCycle(undirectedNetwork)).isTrue(); // cyclic in undirected case
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Jul 18 17:56:35 UTC 2024
    - 6.3K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java

      private static final int NODE_POOL_SIZE = 1000; // must be >> NUM_NODES
    
      @Test
      public void directedNetwork() {
        testNetworkMutation(NetworkBuilder.directed());
      }
    
      @Test
      public void undirectedNetwork() {
        testNetworkMutation(NetworkBuilder.undirected());
      }
    
      private static void testNetworkMutation(NetworkBuilder<? super Integer, Object> networkBuilder) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Apr 10 19:42:18 UTC 2024
    - 4.5K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/graph/NetworkMutationTest.java

      private static final int NODE_POOL_SIZE = 1000; // must be >> NUM_NODES
    
      @Test
      public void directedNetwork() {
        testNetworkMutation(NetworkBuilder.directed());
      }
    
      @Test
      public void undirectedNetwork() {
        testNetworkMutation(NetworkBuilder.undirected());
      }
    
      private static void testNetworkMutation(NetworkBuilder<? super Integer, Object> networkBuilder) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Apr 10 19:42:18 UTC 2024
    - 4.5K bytes
    - Viewed (0)
Back to top