- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 49 for adjacentNodes (0.31 sec)
-
android/guava/src/com/google/common/graph/GraphBuilder.java
newBuilder.nodeOrder = checkNotNull(nodeOrder); return newBuilder; } /** * Specifies the order of iteration for the elements of {@link Graph#edges()}, {@link * Graph#adjacentNodes(Object)}, {@link Graph#predecessors(Object)}, {@link * Graph#successors(Object)} and {@link Graph#incidentEdges(Object)}. * * <p>The default value is {@link ElementOrder#unordered() unordered} for mutable graphs. For
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.3K bytes - Viewed (0) -
android/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 May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 7.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.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 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableGraph.java
return graph.isDirected() ? DirectedGraphConnections.ofImmutable(node, graph.incidentEdges(node), edgeValueFn) : UndirectedGraphConnections.ofImmutable( Maps.asMap(graph.adjacentNodes(node), edgeValueFn)); } @Override BaseGraph<N> delegate() { return backingGraph; } /** * A builder for creating {@link ImmutableGraph} instances, especially {@code static final}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraphBuilder.java
newBuilder.nodeOrder = checkNotNull(nodeOrder); return newBuilder; } /** * Specifies the order of iteration for the elements of {@link ValueGraph#edges()}, {@link * ValueGraph#adjacentNodes(Object)}, {@link ValueGraph#predecessors(Object)}, {@link * ValueGraph#successors(Object)} and {@link ValueGraph#incidentEdges(Object)}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 8K 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) -
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/DirectedGraphConnections.java
return new DirectedGraphConnections<>( adjacentNodeValues, orderedNodeConnectionsBuilder.build(), predecessorCount, successorCount); } @Override public Set<N> adjacentNodes() { if (orderedNodeConnections == null) { return Collections.unmodifiableSet(adjacentNodeValues.keySet()); } else { return new AbstractSet<N>() { @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
*/ Set<N> adjacentNodes(N node); /** * Returns a live view of all nodes in this network 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 network, 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 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public boolean allowsSelfLoops() { return AbstractNetwork.this.allowsSelfLoops(); } @Override public Set<N> adjacentNodes(N node) { return AbstractNetwork.this.adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return AbstractNetwork.this.predecessors(node); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0)