- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 20 for adjacentNode (0.26 sec)
-
guava-tests/test/com/google/common/graph/EndpointPairTest.java
assertThat(ordered.target()).isEqualTo("target"); assertThat(ordered.nodeU()).isEqualTo("source"); assertThat(ordered.nodeV()).isEqualTo("target"); assertThat(ordered.adjacentNode("source")).isEqualTo("target"); assertThat(ordered.adjacentNode("target")).isEqualTo("source"); assertThat(ordered.toString()).isEqualTo("<source -> target>"); } @Test public void testUnorderedEndpointPair() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 9.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/EndpointPairTest.java
assertThat(ordered.target()).isEqualTo("target"); assertThat(ordered.nodeU()).isEqualTo("source"); assertThat(ordered.nodeV()).isEqualTo("target"); assertThat(ordered.adjacentNode("source")).isEqualTo("target"); assertThat(ordered.adjacentNode("target")).isEqualTo("source"); assertThat(ordered.toString()).isEqualTo("<source -> target>"); } @Test public void testUnorderedEndpointPair() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 9.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
} else { return Iterators.unmodifiableIterator( Iterators.transform( graph.adjacentNodes(node).iterator(), (N adjacentNode) -> EndpointPair.unordered(node, adjacentNode))); } } }; return nodeInvalidatableSet(incident, node); } @Override public int degree(N node) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 7.2K 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() { return 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/GraphConstants.java
static final String NOT_AVAILABLE_ON_UNDIRECTED = "Cannot call source()/target() on a EndpointPair from an undirected graph. Consider calling " + "adjacentNode(node) if you already have a node, or nodeU()/nodeV() if you don't."; static final String EDGE_ALREADY_EXISTS = "Edge %s already exists in the graph."; static final String ENDPOINTS_MISMATCH =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
N nodeV = requireNonNull(nodeConnections.get(nodeU)).adjacentNode(edge); return EndpointPair.of(this, nodeU, nodeV); } @Override public Set<N> adjacentNodes(N node) { return nodeInvalidatableSet(checkedConnections(node).adjacentNodes(), node); } @Override public Set<E> edgesConnecting(N nodeU, N nodeV) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableNetwork.java
return (E edge) -> network.incidentNodes(edge).target(); } private static <N, E> Function<E, N> adjacentNodeFn(Network<N, E> network, N node) { return (E edge) -> network.incidentNodes(edge).adjacentNode(node); } /** * A builder for creating {@link ImmutableNetwork} instances, especially {@code static final} * networks. Example: * * <pre>{@code
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/UndirectedMultiNetworkConnections.java
@Override public Set<N> adjacentNodes() { return Collections.unmodifiableSet(adjacentNodesMultiset().elementSet()); } private Multiset<N> adjacentNodesMultiset() { Multiset<N> adjacentNodes = getReference(adjacentNodesReference); if (adjacentNodes == null) { adjacentNodes = HashMultiset.create(incidentEdgeMap.values());
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) -
android/guava/src/com/google/common/graph/UndirectedGraphConnections.java
} @Override public Set<N> adjacentNodes() { return Collections.unmodifiableSet(adjacentNodeValues.keySet()); } @Override public Set<N> predecessors() { return adjacentNodes(); } @Override public Set<N> successors() { return adjacentNodes(); } @Override public Iterator<EndpointPair<N>> incidentEdgeIterator(N thisNode) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/UndirectedNetworkConnections.java
} static <N, E> UndirectedNetworkConnections<N, E> ofImmutable(Map<E, N> incidentEdges) { return new UndirectedNetworkConnections<>(ImmutableBiMap.copyOf(incidentEdges)); } @Override public Set<N> adjacentNodes() { return Collections.unmodifiableSet(((BiMap<E, N>) incidentEdgeMap).values()); } @Override public Set<E> edgesConnecting(N node) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 1.9K bytes - Viewed (0)