- Sort Score
- Result 10 results
- Languages All
Results 11 - 13 of 13 for hasEdgeConnecting (0.16 sec)
-
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
return isDirected() ? successors(node).size() : degree(node); } @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) { checkNotNull(endpoints); if (!isOrderingCompatible(endpoints)) {
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/Network.java
* endpoints are unordered and the network is directed; it simply returns {@code false}. This is * for consistency with {@link Graph#hasEdgeConnecting(EndpointPair)} and {@link * ValueGraph#hasEdgeConnecting(EndpointPair)}. * * @since 27.1 */ boolean hasEdgeConnecting(EndpointPair<N> endpoints); // // Network identity // /**
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/Graph.java
* 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); /** * Returns true if there is an edge that directly connects {@code endpoints} (in the order, if
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)