- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 96 for Networks (0.25 sec)
-
android/guava/src/com/google/common/graph/Network.java
* subtype of {@code Network} that provides methods for adding and removing nodes and edges. If you * do not need to mutate a network (e.g. if you write a method than runs a read-only algorithm on * the network), you should use the non-mutating {@link Network} interface, or an {@link * ImmutableNetwork}. * * <p>You can create an immutable copy of an existing {@code Network} using {@link * ImmutableNetwork#copyOf(Network)}:
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) -
guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
.allowsParallelEdges(!network.allowsParallelEdges()) .allowsSelfLoops(!network.allowsSelfLoops()) .build(); g2.addEdge(N1, N2, E12); assertThat(network).isEqualTo(g2); } // Node/edge sets and node/edge connections are the same, but edge order differs. // (In this case the networks are considered equivalent; the edge add orderings are irrelevant.) @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 5.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableNetwork.java
private ImmutableNetwork(Network<N, E> network) { super( NetworkBuilder.from(network), getNodeConnections(network), getEdgeToReferenceNode(network)); } /** Returns an immutable copy of {@code network}. */ public static <N, E> ImmutableNetwork<N, E> copyOf(Network<N, E> network) { return (network instanceof ImmutableNetwork) ? (ImmutableNetwork<N, E>) network
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 9.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkConnections.java
Set<N> successors(); Set<E> incidentEdges(); 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}. *
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) -
android/guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
.allowsParallelEdges(!network.allowsParallelEdges()) .allowsSelfLoops(!network.allowsSelfLoops()) .build(); g2.addEdge(N1, N2, E12); assertThat(network).isEqualTo(g2); } // Node/edge sets and node/edge connections are the same, but edge order differs. // (In this case the networks are considered equivalent; the edge add orderings are irrelevant.) @Test
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 5.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractUndirectedNetworkConnections.java
import java.util.Collections; import java.util.Map; import java.util.Set; import javax.annotation.CheckForNull; /** * A base implementation of {@link NetworkConnections} for undirected networks. * * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault
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 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. * * @author James Sexton * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault
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/MultiEdgesConnecting.java
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. * * @author James Sexton * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault
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/DirectedNetworkConnections.java
import com.google.common.collect.ImmutableBiMap; import java.util.Collections; import java.util.Map; import java.util.Set; /** * An implementation of {@link NetworkConnections} for directed networks. * * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 2.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/UndirectedMultiNetworkConnections.java
import java.util.Collections; import java.util.HashMap; import java.util.Map; import java.util.Set; import javax.annotation.CheckForNull; /** * An implementation of {@link NetworkConnections} for undirected networks with parallel edges. * * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault final class UndirectedMultiNetworkConnections<N, E>
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.7K bytes - Viewed (0)