- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 1,363 for Node (0.22 sec)
-
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* matches the insertion order. All optional operations (adding and removing) are supported. All * elements, including {@code null}, are permitted. * * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized) * constant time operations. Expected in the hashtable sense (depends on the hash function doing a
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/UndirectedNetworkConnections.java
@Override public Set<N> adjacentNodes() { return Collections.unmodifiableSet(((BiMap<E, N>) incidentEdgeMap).values()); } @Override public Set<E> edgesConnecting(N node) { return new EdgesConnecting<>(((BiMap<E, N>) incidentEdgeMap).inverse(), 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) -
android/guava/src/com/google/common/graph/GraphConnections.java
/** * Remove {@code node} from the set of successors. Returns the value previously associated with * the edge connecting the two nodes. */ @CanIgnoreReturnValue @CheckForNull 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. */
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/StandardMutableNetwork.java
* * <p>Time complexities for mutation methods are all O(1) except for {@code removeNode(N node)}, * which is in O(d_node) where d_node is the degree of {@code node}. * * @author James Sexton * @author Joshua O'Madadhain * @author Omar Darwish * @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 - 5.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingNetwork.java
} @Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @Override public Set<E> incidentEdges(N node) { return delegate().incidentEdges(node); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingGraph.java
} @Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @Override public Set<EndpointPair<N>> incidentEdges(N node) { return delegate().incidentEdges(node); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/DefaultNetworkImplementationsTest.java
@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) { return network.successors(node); } @Override public Set<E> incidentEdges(N node) { return network.incidentEdges(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/EndpointPair.java
* @since 20.0 (but the argument type was changed from {@code Object} to {@code N} in 31.0) */ public final N adjacentNode(N node) { if (node.equals(nodeU)) { return nodeV; } else if (node.equals(nodeV)) { return nodeU; } else { throw new IllegalArgumentException("EndpointPair " + this + " does not contain node " + node); } } /**
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) -
guava-tests/test/com/google/common/graph/TraverserTest.java
/** * A graph that is not a tree (for example, {@code h} is reachable from {@code f} via both {@code * e} and {@code g}) but is a valid input to {@link Traverser#forTree} when starting e.g. at node * {@code a} (all edges are directed facing downwards): * * <pre>{@code * a f * / / \ * b e g * / \ / \ / * c d h * }</pre>
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java
assertThat(graph).isNotEqualTo(g2); } // Node/edge sets are the same, but node/edge connections differ due to edge type. @Test public void equivalent_directedVsUndirected() { graph.putEdge(N1, N2); MutableGraph<Integer> g2 = createGraph(oppositeType(edgeType)); g2.putEdge(N1, N2); assertThat(graph).isNotEqualTo(g2); } // Node/edge sets and node/edge connections are the same, but directedness differs.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 4.7K bytes - Viewed (0)