- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 272 for nodeU (0.21 sec)
-
android/guava/src/com/google/common/graph/AbstractNetwork.java
validateEndpoints(endpoints); return edgeConnectingOrNull(endpoints.nodeU(), endpoints.nodeV()); } @Override public boolean hasEdgeConnecting(N nodeU, N nodeV) { checkNotNull(nodeU); checkNotNull(nodeV); return nodes().contains(nodeU) && successors(nodeU).contains(nodeV); } @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
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) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
checkNotNull(nodeU); checkNotNull(nodeV); return nodes().contains(nodeU) && successors(nodeU).contains(nodeV); } @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { checkNotNull(endpoints); if (!isOrderingCompatible(endpoints)) { return false; } N nodeU = endpoints.nodeU(); N nodeV = endpoints.nodeV();
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/StandardValueGraph.java
return hasEdgeConnectingInternal(checkNotNull(nodeU), checkNotNull(nodeV)); } @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { checkNotNull(endpoints); return isOrderingCompatible(endpoints) && hasEdgeConnectingInternal(endpoints.nodeU(), endpoints.nodeV()); } @Override @CheckForNull
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
MutableGraph<N> subgraph = (nodes instanceof Collection) ? GraphBuilder.from(graph).expectedNodeCount(((Collection) nodes).size()).build() : GraphBuilder.from(graph).build(); for (N node : nodes) { subgraph.addNode(node); } for (N node : subgraph.nodes()) { for (N successorNode : graph.successors(node)) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* equivalent to {@code nodes().contains(nodeU) && successors(nodeU).contains(nodeV)}, and to * {@code edgeConnectingOrNull(nodeU, nodeV) != null}. * * <p>In an undirected network, this is equal to {@code hasEdgeConnecting(nodeV, nodeU)}. * * @since 23.0 */ boolean hasEdgeConnecting(N nodeU, N nodeV); /**
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/StandardNetwork.java
checkArgument(containsNode(nodeV), NODE_NOT_IN_GRAPH, nodeV); return nodePairInvalidatableSet(connectionsU.edgesConnecting(nodeV), nodeU, nodeV); } @Override public Set<E> inEdges(N node) { return nodeInvalidatableSet(checkedConnections(node).inEdges(), node); } @Override public Set<E> outEdges(N node) { return nodeInvalidatableSet(checkedConnections(node).outEdges(), node); } @Override
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
* Returns true if there is an edge that directly connects {@code nodeU} to {@code nodeV}. This is * equivalent to {@code nodes().contains(nodeU) && successors(nodeU).contains(nodeV)}. * * <p>In an undirected graph, this is equal to {@code hasEdgeConnecting(nodeV, nodeU)}. * * @since 23.0 */ boolean hasEdgeConnecting(N nodeU, N nodeV); /**
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) -
guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
assertThat(network.adjacentNodes(nodeU)).contains(nodeV); assertThat(network.outEdges(nodeU)).contains(edge); assertThat(network.incidentEdges(nodeU)).contains(edge); assertThat(network.predecessors(nodeV)).contains(nodeU); assertThat(network.adjacentNodes(nodeV)).contains(nodeU); assertThat(network.inEdges(nodeV)).contains(edge); assertThat(network.incidentEdges(nodeV)).contains(edge);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 33K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
assertThat(network.adjacentNodes(nodeU)).contains(nodeV); assertThat(network.outEdges(nodeU)).contains(edge); assertThat(network.incidentEdges(nodeU)).contains(edge); assertThat(network.predecessors(nodeV)).contains(nodeU); assertThat(network.adjacentNodes(nodeV)).contains(nodeU); assertThat(network.inEdges(nodeV)).contains(edge); assertThat(network.incidentEdges(nodeV)).contains(edge);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 32.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
int outDegree(N node); /** * Returns true if there is an edge that directly connects {@code nodeU} to {@code nodeV}. This is * equivalent to {@code nodes().contains(nodeU) && successors(nodeU).contains(nodeV)}. * * <p>In an undirected graph, this is equal to {@code hasEdgeConnecting(nodeV, nodeU)}. * * @since 23.0 */ @Override boolean hasEdgeConnecting(N nodeU, N nodeV); /**
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)