- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for PredecessorsFunction (0.23 sec)
-
android/guava/src/com/google/common/graph/PredecessorsFunction.java
* * <h3>Usage</h3> * * Given an algorithm, for example: * * <pre>{@code * public <N> someGraphAlgorithm(N startNode, PredecessorsFunction<N> predecessorsFunction); * }</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.1K 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(); /** Returns all edges in this graph. */
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
* @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)