Search Options

Results per page
Sort
Preferred Languages
Advance

Results 31 - 40 of 58 for Directed (0.03 sec)

  1. go.env

    # Use the Go module mirror and checksum database by default.
    # See https://proxy.golang.org for details.
    GOPROXY=https://proxy.golang.org,direct
    GOSUMDB=sum.golang.org
    
    # Automatically download newer toolchains as directed by go.mod files.
    # See https://go.dev/doc/toolchain for details.
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Tue Jun 06 19:18:46 UTC 2023
    - 505 bytes
    - Viewed (0)
  2. guava-tests/test/com/google/common/graph/TestUtil.java

      static final String ERROR_ELEMENT_REMOVED = "used to generate this set";
      private static final String NODE_STRING = "Node";
      private static final String EDGE_STRING = "Edge";
    
      enum EdgeType {
        UNDIRECTED,
        DIRECTED;
      }
    
      private TestUtil() {}
    
      static void assertNodeNotInGraphErrorMessage(Throwable throwable) {
        assertThat(throwable).hasMessageThat().startsWith(NODE_STRING);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Jan 18 02:54:30 UTC 2025
    - 4K bytes
    - Viewed (0)
  3. guava/src/com/google/common/graph/StandardMutableGraph.java

     * limitations under the License.
     */
    
    package com.google.common.graph;
    
    import com.google.common.graph.GraphConstants.Presence;
    
    /**
     * Standard implementation of {@link MutableGraph} that supports both directed and undirected
     * graphs. Instances of this class should be constructed with {@link GraphBuilder}.
     *
     * <p>Time complexities for mutation methods are all O(1) except for {@code removeNode(N node)},
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 2.3K bytes
    - Viewed (0)
  4. src/main/java/jcifs/internal/witness/WitnessEventType.java

     */
    public enum WitnessEventType {
        /**
         * Resource state changed - general resource state modification
         */
        RESOURCE_CHANGE(1),
    
        /**
         * Client should move to different node - directed failover
         */
        CLIENT_MOVE(2),
    
        /**
         * Share moved to different node - share mobility event
         */
        SHARE_MOVE(3),
    
        /**
         * IP address changed - network configuration change
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 23 09:06:40 UTC 2025
    - 2.5K bytes
    - Viewed (0)
  5. android/guava-tests/test/com/google/common/graph/GraphMutationTest.java

      private static final int NUM_EDGES = 1000;
      private static final int NODE_POOL_SIZE = 1000; // must be >> NUM_NODES
    
      @Test
      public void directedGraph() {
        testGraphMutation(GraphBuilder.directed());
      }
    
      @Test
      public void undirectedGraph() {
        testGraphMutation(GraphBuilder.undirected());
      }
    
      private static void testGraphMutation(GraphBuilder<? super Integer> graphBuilder) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 4.2K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/graph/DirectedNetworkConnections.java

    import com.google.common.collect.ImmutableBiMap;
    import java.util.Collections;
    import java.util.Map;
    import java.util.Set;
    
    /**
     * An implementation of {@link NetworkConnections} for directed networks.
     *
     * @author James Sexton
     * @param <N> Node parameter type
     * @param <E> Edge parameter type
     */
    final class DirectedNetworkConnections<N, E> extends AbstractDirectedNetworkConnections<N, E> {
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 2.1K bytes
    - Viewed (0)
  7. guava/src/com/google/common/graph/DirectedNetworkConnections.java

    import com.google.common.collect.ImmutableBiMap;
    import java.util.Collections;
    import java.util.Map;
    import java.util.Set;
    
    /**
     * An implementation of {@link NetworkConnections} for directed networks.
     *
     * @author James Sexton
     * @param <N> Node parameter type
     * @param <E> Edge parameter type
     */
    final class DirectedNetworkConnections<N, E> extends AbstractDirectedNetworkConnections<N, E> {
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 2.1K bytes
    - Viewed (0)
  8. compat/maven-compat/src/main/java/org/apache/maven/repository/MetadataGraphNode.java

     * under the License.
     */
    package org.apache.maven.repository;
    
    import java.util.ArrayList;
    import java.util.List;
    
    /**
     * MetadataGraph node - as it's a directed graph - holds adjacency lists for incident and exident nodes
     *
     *
     */
    @Deprecated
    public class MetadataGraphNode {
        /** node payload */
        MavenArtifactMetadata metadata;
    
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 2.4K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/graph/StandardMutableGraph.java

     * limitations under the License.
     */
    
    package com.google.common.graph;
    
    import com.google.common.graph.GraphConstants.Presence;
    
    /**
     * Standard implementation of {@link MutableGraph} that supports both directed and undirected
     * graphs. Instances of this class should be constructed with {@link GraphBuilder}.
     *
     * <p>Time complexities for mutation methods are all O(1) except for {@code removeNode(N node)},
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 2.3K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/graph/NetworkConnections.java

       * parallel edges, this set cannot be of size greater than one.
       */
      Set<E> edgesConnecting(N node);
    
      /**
       * Returns the node that is adjacent to the origin node along {@code edge}.
       *
       * <p>In the directed case, {@code edge} is assumed to be an outgoing edge.
       */
      N adjacentNode(E edge);
    
      /**
       * Remove {@code edge} from the set of incoming edges. Returns the former predecessor node.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 2.3K bytes
    - Viewed (0)
Back to top