- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 152 for Predecessors (0.24 sec)
-
android/guava/src/com/google/common/graph/ForwardingGraph.java
return delegate().incidentEdgeOrder(); } @Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @Override public Set<EndpointPair<N>> incidentEdges(N node) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.5K bytes - Viewed (0) -
guava/src/com/google/common/graph/ForwardingGraph.java
return delegate().incidentEdgeOrder(); } @Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @Override public Set<EndpointPair<N>> incidentEdges(N node) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
if (isDirected()) { // In undirected graphs, the successor and predecessor sets are equal. // Since views are returned, we need to copy the predecessors that will be removed. // Thus we avoid modifying the underlying view while iterating over it. for (N predecessor : ImmutableList.copyOf(connections.predecessors())) { // requireNonNull is safe because the node is a predecessor. checkState(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat Oct 21 01:50:30 UTC 2023 - 6.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/StandardMutableValueGraph.java
if (isDirected()) { // In undirected graphs, the successor and predecessor sets are equal. // Since views are returned, we need to copy the predecessors that will be removed. // Thus we avoid modifying the underlying view while iterating over it. for (N predecessor : ImmutableList.copyOf(connections.predecessors())) { // requireNonNull is safe because the node is a predecessor. checkState(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat Oct 21 01:50:30 UTC 2023 - 6.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingNetwork.java
return delegate().edgeOrder(); } @Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @Override public Set<E> incidentEdges(N node) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 3.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
ElementOrder<N> nodeOrder(); /** * Returns an {@link ElementOrder} that specifies the order of iteration for the elements of * {@link #edges()}, {@link #adjacentNodes(Object)}, {@link #predecessors(Object)}, {@link * #successors(Object)} and {@link #incidentEdges(Object)}. * * @since 29.0 */ ElementOrder<N> incidentEdgeOrder(); // // Element-level accessors // /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 8.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/BaseGraph.java
ElementOrder<N> nodeOrder(); /** * Returns an {@link ElementOrder} that specifies the order of iteration for the elements of * {@link #edges()}, {@link #adjacentNodes(Object)}, {@link #predecessors(Object)}, {@link * #successors(Object)} and {@link #incidentEdges(Object)}. * * @since 29.0 */ ElementOrder<N> incidentEdgeOrder(); // // Element-level accessors // /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 8.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractValueGraph.java
} @Override public Set<N> adjacentNodes(N node) { return AbstractValueGraph.this.adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return AbstractValueGraph.this.predecessors(node); } @Override public Set<N> successors(N node) { return AbstractValueGraph.this.successors(node); } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 17 13:59:28 UTC 2023 - 4K bytes - Viewed (0) -
guava/src/com/google/common/graph/ForwardingNetwork.java
return delegate().edgeOrder(); } @Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @Override public Set<E> incidentEdges(N node) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 3.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractValueGraph.java
} @Override public Set<N> adjacentNodes(N node) { return AbstractValueGraph.this.adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return AbstractValueGraph.this.predecessors(node); } @Override public Set<N> successors(N node) { return AbstractValueGraph.this.successors(node); } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 17 13:59:28 UTC 2023 - 4.3K bytes - Viewed (0)