Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 154 for Edge (0.01 sec)

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

                                edge.getTarget() == null
                                        ? null
                                        : edge.getTarget().getMd().getError());
                        MetadataGraphVertex newV = res.addVertex(newMd);
                        MetadataGraphVertex sourceV = res.addVertex(edge.getSource().getMd());
    
                        res.addEdge(sourceV, newV, edge);
                    }
                }
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Wed Jul 23 17:27:08 UTC 2025
    - 7.4K bytes
    - Viewed (0)
  2. guava/src/com/google/common/graph/Network.java

      /**
       * Returns the nodes which are the endpoints of {@code edge} in this network.
       *
       * @throws IllegalArgumentException if {@code edge} is not an element of this network
       */
      EndpointPair<N> incidentNodes(E edge);
    
      /**
       * Returns a live view of the edges which have an {@link #incidentNodes(Object) incident node} in
       * common with {@code edge}. An edge is not considered adjacent to itself.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 22:03:02 UTC 2025
    - 22.5K bytes
    - Viewed (0)
  3. guava/src/com/google/common/graph/EndpointPair.java

    /**
     * An immutable pair representing the two endpoints of an edge in a graph. The {@link EndpointPair}
     * of a directed edge is an ordered pair of nodes ({@link #source()} and {@link #target()}). The
     * {@link EndpointPair} of an undirected edge is an unordered pair of nodes ({@link #nodeU()} and
     * {@link #nodeV()}).
     *
     * <p>The edge is a self-loop if, and only if, the two endpoints are equal.
     *
     * @author James Sexton
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue Jul 08 18:32:10 UTC 2025
    - 8.1K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/graph/Graphs.java

        for (N node : graph.nodes()) {
          copy.addNode(node);
        }
        for (EndpointPair<N> edge : graph.edges()) {
          // requireNonNull is safe because the endpoint pair comes from the graph.
          copy.putEdgeValue(
              edge.nodeU(),
              edge.nodeV(),
              requireNonNull(graph.edgeValueOrDefault(edge.nodeU(), edge.nodeV(), null)));
        }
        return copy;
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  5. guava/src/com/google/common/graph/Graphs.java

        for (N node : graph.nodes()) {
          copy.addNode(node);
        }
        for (EndpointPair<N> edge : graph.edges()) {
          // requireNonNull is safe because the endpoint pair comes from the graph.
          copy.putEdgeValue(
              edge.nodeU(),
              edge.nodeV(),
              requireNonNull(graph.edgeValueOrDefault(edge.nodeU(), edge.nodeV(), null)));
        }
        return copy;
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 23.3K bytes
    - Viewed (0)
  6. android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java

          assertThat(network.inEdges(nodeV)).contains(edge);
          assertThat(network.incidentEdges(nodeV)).contains(edge);
    
          for (N incidentNode : network.incidentNodes(edge)) {
            assertThat(network.nodes()).contains(incidentNode);
            for (E adjacentEdge : network.incidentEdges(incidentNode)) {
              assertTrue(
                  edge.equals(adjacentEdge) || network.adjacentEdges(edge).contains(adjacentEdge));
            }
          }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 32.7K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/graph/EndpointPair.java

    /**
     * An immutable pair representing the two endpoints of an edge in a graph. The {@link EndpointPair}
     * of a directed edge is an ordered pair of nodes ({@link #source()} and {@link #target()}). The
     * {@link EndpointPair} of an undirected edge is an unordered pair of nodes ({@link #nodeU()} and
     * {@link #nodeV()}).
     *
     * <p>The edge is a self-loop if, and only if, the two endpoints are equal.
     *
     * @author James Sexton
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue Jul 08 18:32:10 UTC 2025
    - 8.1K bytes
    - Viewed (0)
  8. src/test/java/jcifs/smb/SmbTransportInternalTest.java

            SmbException ex = assertThrows(SmbException.class, () -> transport.hasCapability(42));
            assertTrue(ex.getMessage().contains("failed"));
            verify(transport).hasCapability(42);
        }
    
        // Edge: disconnected status toggles
        @ParameterizedTest
        @DisplayName("isDisconnected reflects current mocked state")
        @ValueSource(booleans = { true, false })
        void isDisconnected_states(boolean disconnected) {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 07:14:38 UTC 2025
    - 12.1K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/graph/EdgesConnecting.java

      }
    
      @Override
      public int size() {
        return getConnectingEdge() == null ? 0 : 1;
      }
    
      @Override
      public boolean contains(@Nullable Object edge) {
        E connectingEdge = getConnectingEdge();
        return connectingEdge != null && connectingEdge.equals(edge);
      }
    
      private @Nullable E getConnectingEdge() {
        return nodeToOutEdge.get(targetNode);
      }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 2.1K bytes
    - Viewed (0)
  10. tensorflow/c/c_api.cc

      mutex_lock l(graph->mu);
      std::vector<const tensorflow::Edge*> control_edges;
      for (const tensorflow::Edge* edge : op->node.in_edges()) {
        if (!edge->IsControlEdge()) continue;
        control_edges.push_back(edge);
      }
      for (const tensorflow::Edge* edge : control_edges) {
        graph->graph.RemoveControlEdge(edge);
      }
    }
    
    void TF_SetRequireShapeInferenceFns(TF_Graph* graph, bool require) {
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Tue May 13 06:30:43 UTC 2025
    - 102.3K bytes
    - Viewed (0)
Back to top