- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for Gridin (0.96 sec)
-
android/guava/src/com/google/common/graph/AbstractDirectedNetworkConnections.java
*/ @ElementTypesAreNonnullByDefault abstract class AbstractDirectedNetworkConnections<N, E> implements NetworkConnections<N, E> { /** Keys are edges incoming to the origin node, values are the source node. */ final Map<E, N> inEdgeMap; /** Keys are edges outgoing from the origin node, values are the target node. */ final Map<E, N> outEdgeMap; private int selfLoopCount;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractUndirectedNetworkConnections.java
* @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault abstract class AbstractUndirectedNetworkConnections<N, E> implements NetworkConnections<N, E> { /** Keys are edges incident to the origin node, values are the node at the other end. */ final Map<E, N> incidentEdgeMap; AbstractUndirectedNetworkConnections(Map<E, N> incidentEdgeMap) { this.incidentEdgeMap = checkNotNull(incidentEdgeMap); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EdgesConnecting.java
import com.google.common.collect.UnmodifiableIterator; import java.util.AbstractSet; import java.util.Map; import javax.annotation.CheckForNull; /** * A class to represent the set of edges connecting an (implicit) origin node to a target node. * * <p>The {@link #nodeToOutEdge} map means this class only works on networks without parallel edges. * See {@link MultiEdgesConnecting} for a class that works with parallel edges. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConnections.java
V removeSuccessor(N node); /** * Add {@code node} as a predecessor to the origin node. In the case of an undirected graph, it * also becomes a successor. Associates {@code value} with the edge connecting the two nodes. */ void addPredecessor(N node, V value); /** * Add {@code node} as a successor to the origin node. In the case of an undirected graph, it also
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPair.java
* returns an arbitrary (but consistent) endpoint of the origin edge. */ public final N nodeU() { return nodeU; } /** * Returns the node {@link #adjacentNode(Object) adjacent} to {@link #nodeU()} along the origin * edge. If this {@link EndpointPair} {@link #isOrdered()}, this is equal to {@link #target()}. */ public final N nodeV() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MultiEdgesConnecting.java
import java.util.AbstractSet; import java.util.Iterator; import java.util.Map; import java.util.Map.Entry; import javax.annotation.CheckForNull; /** * A class to represent the set of edges connecting an (implicit) origin node to a target node. * * <p>The {@link #outEdgeToNode} map allows this class to work on networks with parallel edges. See * {@link EdgesConnecting} for a class that is more efficient but forbids parallel edges. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 2.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkConnections.java
Set<E> inEdges(); Set<E> outEdges(); /** * Returns the set of edges connecting the origin node to {@code node}. For networks without * parallel edges, this set cannot be of size greater than one. */ Set<E> edgesConnecting(N node); /** * Returns the node that is adjacent to the origin node along {@code edge}. * * <p>In the directed case, {@code edge} is assumed to be an outgoing edge. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.3K bytes - Viewed (0)