- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 4,867 for node (0.25 sec)
-
android/guava/src/com/google/common/graph/MutableValueGraph.java
* * <p>If {@code nodeU} and {@code nodeV} are not already present in this graph, this method will * silently {@link #addNode(Object) add} {@code nodeU} and {@code nodeV} to the graph. * * @return the value previously associated with the edge connecting {@code nodeU} to {@code * nodeV}, or null if there was no such edge.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
assertThat(graph.predecessors(node)).hasSize(graph.inDegree(node)); assertThat(graph.successors(node)).hasSize(graph.outDegree(node)); } else { int selfLoopCount = graph.adjacentNodes(node).contains(node) ? 1 : 0; assertThat(graph.degree(node)).isEqualTo(graph.adjacentNodes(node).size() + selfLoopCount);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* * @throws IllegalArgumentException if {@code node} is not an element of this graph */ @Override 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)}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/TreeTraverserTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 3.3K bytes - Viewed (0) -
src/main/java/jcifs/netbios/NbtAddress.java
/** * A B node only broadcasts name queries. This is the default if a * nameserver such as WINS or Samba is not specified. */ public static final int B_NODE = 0; /** * A Point-to-Point node, or P node, unicasts queries to a nameserver * only. Natrually the <code>jcifs.netbios.nameserver</code> property must * be set. */
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 15.2K 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/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/NetworkConnections.java
Set<E> outEdges(); /** * Returns the set of edges connecting the origin node to {@code node}. For networks without * parallel edges, this set cannot be of size greater than one. */ Set<E> edgesConnecting(N node); /** * Returns the node that is adjacent to the origin node along {@code edge}. * * <p>In the directed case, {@code edge} is assumed to be an outgoing edge. */ N adjacentNode(E edge); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* leftChild(node)} and {@code rightChild(node)}, this method can be called as * * <pre>{@code * Traverser.forTree(node -> ImmutableList.of(leftChild(node), rightChild(node))); * }</pre> * * @param tree {@link SuccessorsFunction} representing a directed acyclic graph that has at most * one path between any two nodes */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedListMultimap.java
*/ private void removeNode(Node<K, V> node) { if (node.previous != null) { node.previous.next = node.next; } else { // node was head head = node.next; } if (node.next != null) { node.next.previous = node.previous; } else { // node was tail tail = node.previous; } if (node.previousSibling == null && node.nextSibling == null) { /*
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 27.2K bytes - Viewed (0)