Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 27 of 27 for incidentEdges (0.05 sec)

  1. android/guava/src/com/google/common/graph/AbstractBaseGraph.java

          }
        };
      }
    
      @Override
      public ElementOrder<N> incidentEdgeOrder() {
        return ElementOrder.unordered();
      }
    
      @Override
      public Set<EndpointPair<N>> incidentEdges(N node) {
        checkNotNull(node);
        checkArgument(nodes().contains(node), "Node %s is not an element of this graph.", node);
        IncidentEdgeSet<N> incident =
            new IncidentEdgeSet<N>(this, node) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 7.2K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/graph/ValueGraphBuilder.java

       * ValueGraph#adjacentNodes(Object)}, {@link ValueGraph#predecessors(Object)}, {@link
       * ValueGraph#successors(Object)} and {@link ValueGraph#incidentEdges(Object)}.
       *
       * <p>The default value is {@link ElementOrder#unordered() unordered} for mutable graphs. For
       * immutable graphs, this value is ignored; they always have a {@link ElementOrder#stable()
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 7.9K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/graph/ImmutableValueGraph.java

                requireNonNull(graph.edgeValueOrDefault(node, successorNode, null));
        return graph.isDirected()
            ? DirectedGraphConnections.ofImmutable(
                node, graph.incidentEdges(node), successorNodeToValueFn)
            : UndirectedGraphConnections.ofImmutable(
                Maps.asMap(graph.adjacentNodes(node), successorNodeToValueFn));
      }
    
      /**
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 7.9K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/graph/GraphBuilder.java

      /**
       * Specifies the order of iteration for the elements of {@link Graph#edges()}, {@link
       * Graph#adjacentNodes(Object)}, {@link Graph#predecessors(Object)}, {@link
       * Graph#successors(Object)} and {@link Graph#incidentEdges(Object)}.
       *
       * <p>The default value is {@link ElementOrder#unordered() unordered} for mutable graphs. For
       * immutable graphs, this value is ignored; they always have a {@link ElementOrder#stable()
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 7.3K bytes
    - Viewed (0)
  5. guava/src/com/google/common/graph/ValueGraphBuilder.java

       * ValueGraph#adjacentNodes(Object)}, {@link ValueGraph#predecessors(Object)}, {@link
       * ValueGraph#successors(Object)} and {@link ValueGraph#incidentEdges(Object)}.
       *
       * <p>The default value is {@link ElementOrder#unordered() unordered} for mutable graphs. For
       * immutable graphs, this value is ignored; they always have a {@link ElementOrder#stable()
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 7.9K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/graph/Graphs.java

        }
    
        @Override
        public Set<EndpointPair<N>> incidentEdges(N node) {
          return new IncidentEdgeSet<N>(this, node) {
            @Override
            public Iterator<EndpointPair<N>> iterator() {
              return Iterators.transform(
                  delegate().incidentEdges(node).iterator(),
                  edge -> EndpointPair.of(delegate(), edge.nodeV(), edge.nodeU()));
            }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  7. guava/src/com/google/common/graph/Graphs.java

        }
    
        @Override
        public Set<EndpointPair<N>> incidentEdges(N node) {
          return new IncidentEdgeSet<N>(this, node) {
            @Override
            public Iterator<EndpointPair<N>> iterator() {
              return Iterators.transform(
                  delegate().incidentEdges(node).iterator(),
                  edge -> EndpointPair.of(delegate(), edge.nodeV(), edge.nodeU()));
            }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 23.3K bytes
    - Viewed (0)
Back to top