- Sort Score
- Result 10 results
- Languages All
Results 21 - 27 of 27 for edgesConnecting (0.24 sec)
-
android/guava/src/com/google/common/graph/StandardNetwork.java
} @Override public Set<N> adjacentNodes(N node) { return nodeInvalidatableSet(checkedConnections(node).adjacentNodes(), node); } @Override public Set<E> edgesConnecting(N nodeU, N nodeV) { NetworkConnections<N, E> connectionsU = checkedConnections(nodeU); if (!allowsSelfLoops && nodeU == nodeV) { // just an optimization, only check reference equality return ImmutableSet.of();
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/Graphs.java
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/GraphConstants.java
+ "so it cannot be reused to connect the following nodes: %s."; static final String MULTIPLE_EDGES_CONNECTING = "Cannot call edgeConnecting() when parallel edges exist between %s and %s. Consider calling " + "edgesConnecting() instead."; static final String PARALLEL_EDGES_NOT_ALLOWED = "Nodes %s and %s are already connected by a different edge. To construct a graph "
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* * <p>In an undirected network, this is equal to {@code edgesConnecting(nodeV, nodeU)}. * * <p>The resulting set of edges will be parallel (i.e. have equal {@link * #incidentNodes(Object)}). If this network does not {@link #allowsParallelEdges() allow parallel * edges}, the resulting set will contain at most one edge (equivalent to {@code * edgeConnecting(nodeU, nodeV).asSet()}). *
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/ElementOrder.java
* <li>{@code inEdges(node)}: Edge insertion order * <li>{@code outEdges(node)}: Edge insertion order * <li>{@code adjacentEdges(edge)}: Stable order * <li>{@code edgesConnecting(nodeU, nodeV)}: Edge insertion order * </ul> * </ul> * * @since 29.0 */ public static <S> ElementOrder<S> stable() { return new ElementOrder<>(Type.STABLE, null); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 6.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedMultiNetworkConnections.java
successors = HashMultiset.create(outEdgeMap.values()); successorsReference = new SoftReference<>(successors); } return successors; } @Override public Set<E> edgesConnecting(N node) { return new MultiEdgesConnecting<E>(outEdgeMap, node) { @Override public int size() { return successorsMultiset().count(node); } }; } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 4.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableNetwork.java
Map<E, N> inEdgeMap = Maps.asMap(network.inEdges(node), sourceNodeFn(network)); Map<E, N> outEdgeMap = Maps.asMap(network.outEdges(node), targetNodeFn(network)); int selfLoopCount = network.edgesConnecting(node, node).size(); return network.allowsParallelEdges() ? DirectedMultiNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount)
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 9.6K bytes - Viewed (0)