Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 5 of 5 for asGraph (0.04 sec)

  1. compat/maven-compat/src/main/java/org/apache/maven/repository/MetadataResolutionRequest.java

            this.asResolvedTree = asResolvedTree;
            return this;
        }
    
        public boolean isAsGraph() {
            return asGraph;
        }
    
        public MetadataResolutionRequest setAsGraph(boolean asGraph) {
            this.asGraph = asGraph;
            return this;
        }
    
        public MetadataResolutionRequest setScope(String scope) {
            this.scope = scope;
            return this;
        }
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Fri Jun 06 14:28:57 UTC 2025
    - 5.4K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java

        Graph<N> asGraph = network.asGraph();
        AbstractGraphTest.validateGraph(asGraph);
        assertThat(network.nodes()).isEqualTo(asGraph.nodes());
        assertThat(network.edges().size()).isAtLeast(asGraph.edges().size());
        assertThat(network.nodeOrder()).isEqualTo(asGraph.nodeOrder());
        assertThat(network.isDirected()).isEqualTo(asGraph.isDirected());
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 32.7K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/graph/Graphs.java

        if (!network.isDirected()
            && network.allowsParallelEdges()
            && network.edges().size() > network.asGraph().edges().size()) {
          return true;
        }
        return hasCycle(network.asGraph());
      }
    
      /**
       * Performs a traversal of the nodes reachable from {@code startNode}. If we ever reach a node
    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

        if (!network.isDirected()
            && network.allowsParallelEdges()
            && network.edges().size() > network.asGraph().edges().size()) {
          return true;
        }
        return hasCycle(network.asGraph());
      }
    
      /**
       * Performs a traversal of the nodes reachable from {@code startNode}. If we ever reach a node
    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. guava/src/com/google/common/graph/Network.java

       * treated as if collapsed into a single edge. For example, the {@link #degree(Object)} of a node
       * in the {@link Graph} view may be less than the degree of the same node in this {@link Network}.
       */
      Graph<N> asGraph();
    
      //
      // Network properties
      //
    
      /**
       * Returns true if the edges in this network are directed. Directed edges connect a {@link
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 22:03:02 UTC 2025
    - 22.5K bytes
    - Viewed (0)
Back to top