- Sort Score
- Result 10 results
- Languages All
Results 1 - 8 of 8 for SuccessorsFunction (0.23 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) -
guava-tests/test/com/google/common/graph/TraverserTest.java
.inOrder(); } private static class RequestSavingGraph implements SuccessorsFunction<Character> { private final SuccessorsFunction<Character> delegate; final Multiset<Character> requestedNodes = HashMultiset.create(); RequestSavingGraph(SuccessorsFunction<Character> delegate) { this.delegate = checkNotNull(delegate); } @Override
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
/** * An object that can traverse the nodes that are reachable from a specified (set of) start node(s) * using a specified {@link SuccessorsFunction}. * * <p>There are two entry points for creating a {@code Traverser}: {@link * #forTree(SuccessorsFunction)} and {@link #forGraph(SuccessorsFunction)}. You should choose one * based on your answers to the following questions: * * <ol>
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
.inOrder(); } private static class RequestSavingGraph implements SuccessorsFunction<Character> { private final SuccessorsFunction<Character> delegate; final Multiset<Character> requestedNodes = HashMultiset.create(); RequestSavingGraph(SuccessorsFunction<Character> delegate) { this.delegate = checkNotNull(delegate); } @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava/src/com/google/common/io/Files.java
* "/home/alice", ...]} * * @since 23.5 */ public static Traverser<File> fileTraverser() { return Traverser.forTree(FILE_TREE); } private static final SuccessorsFunction<File> FILE_TREE = new SuccessorsFunction<File>() { @Override public Iterable<File> successors(File file) { // check isDirectory() just because it may be faster than listFiles() on a non-directory
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 33.1K 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) -
android/guava/src/com/google/common/graph/Network.java
* @param <E> Edge parameter type * @since 20.0 */ @Beta @DoNotMock("Use NetworkBuilder to create a real instance") @ElementTypesAreNonnullByDefault public interface Network<N, E> extends SuccessorsFunction<N>, PredecessorsFunction<N> { // // Network-level accessors // /** Returns all nodes in this network, 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 - 21.1K bytes - Viewed (0)