- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for AbstractValueGraph (0.49 sec)
-
android/guava/src/com/google/common/graph/StandardValueGraph.java
* @author Joshua O'Madadhain * @author Omar Darwish * @param <N> Node parameter type * @param <V> Value parameter type */ @ElementTypesAreNonnullByDefault class StandardValueGraph<N, V> extends AbstractValueGraph<N, V> { private final boolean isDirected; private final boolean allowsSelfLoops; private final ElementOrder<N> nodeOrder; final MapIteratorCache<N, GraphConnections<N, V>> nodeConnections;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* doesn't. Additionally, the order in which nodes or edges are added to the graph, and the order * in which they are iterated over, are irrelevant. * * <p>A reference implementation of this is provided by {@link AbstractValueGraph#equals(Object)}. */ @Override boolean equals(@CheckForNull Object object); /** * Returns the hash code for this graph. The hash code of a graph is defined as the hash code of a
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
return delegate().hasEdgeConnecting(transpose(endpoints)); } } // NOTE: this should work as long as the delegate graph's implementation of edges() (like that of // AbstractValueGraph) derives its behavior from calling successors(). private static class TransposedValueGraph<N, V> extends ForwardingValueGraph<N, V> { private final ValueGraph<N, V> graph;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0)