- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 49 for adjacentNodes (0.18 sec)
-
android/guava/src/com/google/common/graph/ValueGraph.java
*/ @Override Set<N> adjacentNodes(N node); /** * Returns a live view of all nodes in this graph adjacent to {@code node} which can be reached by * traversing {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge. * * <p>In an undirected graph, this is equivalent to {@link #adjacentNodes(Object)}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/DefaultNetworkImplementationsTest.java
return network.nodeOrder(); } @Override public ElementOrder<E> edgeOrder() { return network.edgeOrder(); } @Override public Set<N> adjacentNodes(N node) { return network.adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return network.predecessors(node); } @Override public Set<N> successors(N node) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 7.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractUndirectedNetworkConnections.java
this.incidentEdgeMap = checkNotNull(incidentEdgeMap); } @Override public Set<N> predecessors() { return adjacentNodes(); } @Override public Set<N> successors() { return adjacentNodes(); } @Override public Set<E> incidentEdges() { return Collections.unmodifiableSet(incidentEdgeMap.keySet()); } @Override
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/IncidentEdgeSet.java
public int size() { if (graph.isDirected()) { return graph.inDegree(node) + graph.outDegree(node) - (graph.successors(node).contains(node) ? 1 : 0); } else { return graph.adjacentNodes(node).size(); } } @Override public boolean contains(@CheckForNull Object obj) { if (!(obj instanceof EndpointPair)) { return false; }
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/src/com/google/common/graph/GraphConnections.java
* a {@link Graph}. * * @author James Sexton * @param <N> Node parameter type * @param <V> Value parameter type */ @ElementTypesAreNonnullByDefault interface GraphConnections<N, V> { Set<N> adjacentNodes(); Set<N> predecessors(); Set<N> successors(); /** * Returns an iterator over the incident edges. *
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/AbstractValueGraph.java
@Override public ElementOrder<N> incidentEdgeOrder() { return AbstractValueGraph.this.incidentEdgeOrder(); } @Override public Set<N> adjacentNodes(N node) { return AbstractValueGraph.this.adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return AbstractValueGraph.this.predecessors(node); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 17 13:59:28 GMT 2023 - 4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ValueGraphTest.java
assertThat(graph.allowsSelfLoops()).isEqualTo(asGraph.allowsSelfLoops()); for (Integer node : graph.nodes()) { assertThat(graph.adjacentNodes(node)).isEqualTo(asGraph.adjacentNodes(node)); assertThat(graph.predecessors(node)).isEqualTo(asGraph.predecessors(node)); assertThat(graph.successors(node)).isEqualTo(asGraph.successors(node));
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 18:35:19 GMT 2024 - 20K 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/BaseGraph.java
*/ Set<N> adjacentNodes(N node); /** * Returns a live view of all nodes in this graph adjacent to {@code node} which can be reached by * traversing {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge. * * <p>In an undirected graph, this is equivalent to {@link #adjacentNodes(Object)}. *
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/AbstractDirectedNetworkConnections.java
this.selfLoopCount = checkNonNegative(selfLoopCount); checkState(selfLoopCount <= inEdgeMap.size() && selfLoopCount <= outEdgeMap.size()); } @Override public Set<N> adjacentNodes() { return Sets.union(predecessors(), successors()); } @Override public Set<E> incidentEdges() { return new AbstractSet<E>() { @Override public UnmodifiableIterator<E> iterator() {
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)