- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for SuccessorsFunction (0.24 sec)
-
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* * <h3>Usage</h3> * * Given an algorithm, for example: * * <pre>{@code * public <N> someGraphAlgorithm(N startNode, SuccessorsFunction<N> successorsFunction); * }</pre> * * you will invoke it depending on the graph representation you're using. * * <p>If you have an instance of one of the primary {@code common.graph} types ({@link Graph},
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeTraverser.java
* @since 15.0 * @deprecated Use {@link com.google.common.graph.Traverser} instead. All instance methods have * their equivalent on the result of {@code Traverser.forTree(tree)} where {@code tree} * implements {@code SuccessorsFunction}, which has a similar API as {@link #children} or can be * the same lambda function as passed into {@link #using(Function)}. * <p>This class is scheduled to be removed in October 2019. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
* * @author James Sexton * @param <N> Node parameter type */ @ElementTypesAreNonnullByDefault interface BaseGraph<N> extends SuccessorsFunction<N>, PredecessorsFunction<N> { // // Graph-level accessors // /** Returns all nodes in this graph, in the order specified by {@link #nodeOrder()}. */ Set<N> nodes();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 8.8K bytes - Viewed (0)