- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 328 for node12 (0.22 sec)
-
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) -
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/ImmutableValueGraph.java
// whatever ordering the graph's nodes do, so ImmutableSortedMap is unnecessary even if the // input nodes are sorted. ImmutableMap.Builder<N, GraphConnections<N, V>> nodeConnections = ImmutableMap.builder(); for (N node : graph.nodes()) { nodeConnections.put(node, connectionsOf(graph, node)); } return nodeConnections.buildOrThrow(); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.7K 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) -
maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/ConflictResolver.java
* * @param node1 the first artifact declaration * @param node2 the second artifact declaration * @return the artifact declaration to use: <code>node1</code>; <code>node2</code>; or <code>null</code>if * this conflict cannot be resolved * @since 3.0 */ ResolutionNode resolveConflict(ResolutionNode node1, ResolutionNode node2);
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 1.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
for (E key : keys) { LockGraphNode node = new LockGraphNode(getLockName(key)); nodes.add(node); map.put(key, node); } // Pre-populate all allowedPriorLocks with nodes of smaller ordinal. for (int i = 1; i < numKeys; i++) { nodes.get(i).checkAcquiredLocks(Policies.THROW, nodes.subList(0, i)); } // Pre-populate all disallowedPriorLocks with nodes of larger ordinal.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphMutationTest.java
AbstractGraphTest.validateGraph(graph); Collections.shuffle(nodeList, gen); for (Integer node : nodeList) { assertThat(graph.addNode(node)).isTrue(); } Collections.shuffle(edgeList, gen); for (EndpointPair<Integer> edge : edgeList) { assertThat(graph.putEdge(edge.nodeU(), edge.nodeV())).isTrue(); } assertThat(graph.nodes()).hasSize(NUM_NODES);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableGraph.java
*/ @CanIgnoreReturnValue boolean addNode(N node); /** * Adds an edge connecting {@code nodeU} to {@code nodeV} if one is not already present. * * <p>If the graph is directed, the resultant edge will be directed; otherwise, it will be * undirected. * * <p>If {@code nodeU} and {@code nodeV} are not already present in this graph, this method will
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.9K 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)