- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 113 for Hedger (0.14 sec)
-
android/guava-tests/test/com/google/common/graph/GraphsTest.java
assertThat(e.getMessage()).contains(ERROR_PARALLEL_EDGE); e = assertThrows(IllegalArgumentException.class, () -> undirectedGraph.addEdge(N2, N1, E21)); assertThat(e.getMessage()).contains(ERROR_PARALLEL_EDGE); // By default, self-loop edges are not allowed. e = assertThrows(IllegalArgumentException.class, () -> undirectedGraph.addEdge(N1, N1, E11));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 24.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
assertThat(graph.hasEdgeConnecting(endpoints.nodeU(), endpoints.nodeV())).isTrue(); } } } sanityCheckSet(graph.edges()); assertThat(graph.edges()).doesNotContain(EndpointPair.of(graph, new Object(), new Object())); assertThat(graph.edges()).isEqualTo(allEndpointPairs); } /** * Verifies that the {@code Set} returned by {@code nodes} has the expected mutability property
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ElementOrderTest.java
assertThat(network.edgeOrder()) .isEqualTo(ElementOrder.sorted(Ordering.<String>natural().reverse())); assertThat(network.edges()).containsExactly("p", "i", "e").inOrder(); assertThat(network.nodeOrder()).isEqualTo(ElementOrder.insertion()); // default } // Combined node and edge order tests @Test public void nodeOrderUnorderedAndEdgesSorted() { MutableNetwork<Integer, String> network =
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
*/ @Beta @DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges") @ElementTypesAreNonnullByDefault public interface SuccessorsFunction<N> { /** * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing * {@code node}'s outgoing edges in the direction (if any) of the edge. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
@Beta @DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges") @ElementTypesAreNonnullByDefault public interface PredecessorsFunction<N> { /** * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing * {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ElementOrder.java
* <ul> * <li>{@code edges()}: Stable order * <li>{@code adjacentNodes(node)}: Connecting edge insertion order * <li>{@code predecessors(node)}: Connecting edge insertion order * <li>{@code successors(node)}: Connecting edge insertion order * <li>{@code incidentEdges(node)}: Edge insertion order * </ul> * <li>For {@link Network}:
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/DirectedGraphConnections.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableGraph.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractDirectedNetworkConnections.java
} @Override public N adjacentNode(E edge) { // Since the reference node is defined to be 'source' for directed graphs, // we can assume this edge lives in the set of outgoing edges. // (We're relying on callers to call this method only with an edge that's in the graph.) return requireNonNull(outEdgeMap.get(edge)); } @Override public N removeInEdge(E edge, boolean isSelfLoop) { if (isSelfLoop) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraphBuilder.java
ValueGraphBuilder<N1, V1> castBuilder = cast(); return new ImmutableValueGraph.Builder<>(castBuilder); } /** * Specifies whether the graph will allow self-loops (edges that connect a node to itself). * Attempting to add a self-loop to a graph that does not allow them will throw an {@link * UnsupportedOperationException}. * * <p>The default value is {@code false}. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 8K bytes - Viewed (0)