- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 18 for predecessors (0.27 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
android/guava/src/com/google/common/graph/PredecessorsFunction.java
* which has a method {@code getParents()} that retrieves its predecessors in a graph: * * {@snippet : * someGraphAlgorithm(startNode, MyNode::getParents); * } * * <p>If you have some other mechanism for returning the predecessors of a node, or one that doesn't * return a {@code Iterable<? extends N>}, then you can use a lambda to perform a more generalCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 4K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/StandardValueGraph.java
@Override public Set<N> adjacentNodes(N node) { return nodeInvalidatableSet(checkedConnections(node).adjacentNodes(), node); } @Override public Set<N> predecessors(N node) { return nodeInvalidatableSet(checkedConnections(node).predecessors(), node); } @Override public Set<N> successors(N node) { return nodeInvalidatableSet(checkedConnections(node).successors(), node); } @Override
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Apr 02 14:49:41 GMT 2026 - 6K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
@Override 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 */ @Override ElementOrder<N> incidentEdgeOrder(); // // Element-level accessors
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 15K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/Graph.java
@Override 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 */ @Override ElementOrder<N> incidentEdgeOrder(); // // Element-level accessors
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 13.6K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
} @Override public Set<E> outEdges(N node) { return nodeInvalidatableSet(checkedConnections(node).outEdges(), node); } @Override public Set<N> predecessors(N node) { return nodeInvalidatableSet(checkedConnections(node).predecessors(), node); } @Override public Set<N> successors(N node) { return nodeInvalidatableSet(checkedConnections(node).successors(), node); }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Apr 02 14:49:41 GMT 2026 - 6.9K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/ElementOrder.java
* <li>{@code predecessors(node)}: Connecting edge insertion order * <li>{@code successors(node)}: Connecting edge insertion order * <li>{@code incidentEdges(node)}: Edge insertion order * </ul> * <li>For {@link Network}: * <ul> * <li>{@code adjacentNodes(node)}: Stable order * <li>{@code predecessors(node)}: Connecting edge insertion order
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 6.5K bytes - Click Count (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); } @OverrideCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 4K bytes - Click Count (0) -
docs/en/docs/history-design-future.md
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 4K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public Set<N> adjacentNodes(N node) { return AbstractNetwork.this.adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return AbstractNetwork.this.predecessors(node); } @Override public Set<N> successors(N node) { return AbstractNetwork.this.successors(node); }Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 10K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* transformation: * * {@snippet : * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.leftChild(), node.rightChild())); * } * * <p>Graph algorithms that need additional capabilities (accessing both predecessors and * successors, iterating over the edges, etc.) should declare their input to be of a type that * provides those capabilities, such as {@link Graph}, {@link ValueGraph}, or {@link Network}. *Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 4.2K bytes - Click Count (0)