- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 105 for redirected (0.14 sec)
-
guava-tests/test/com/google/common/graph/ValueGraphTest.java
} @Test public void hasEdgeConnecting_undirected_backwards() { graph = ValueGraphBuilder.undirected().build(); graph.putEdgeValue(1, 2, "A"); assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(2, 1))).isTrue(); } @Test public void hasEdgeConnecting_undirected_mismatch() { graph = ValueGraphBuilder.undirected().build(); graph.putEdgeValue(1, 2, "A");
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 18:35:19 GMT 2024 - 20K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ImmutableNetworkTest.java
ImmutableNetwork.copyOf(NetworkBuilder.directed().<String, String>build()); Network<String, String> network2 = ImmutableNetwork.copyOf(network1); assertThat(network2).isSameInstanceAs(network1); } @Test public void edgesConnecting_directed() { MutableNetwork<String, String> mutableNetwork = NetworkBuilder.directed().allowsSelfLoops(true).build();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Sun May 05 18:02:35 GMT 2019 - 5.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkBuilder.java
private NetworkBuilder(boolean directed) { super(directed); } /** Returns a {@link NetworkBuilder} for building directed networks. */ public static NetworkBuilder<Object, Object> directed() { return new NetworkBuilder<>(true); } /** Returns a {@link NetworkBuilder} for building undirected networks. */ public static NetworkBuilder<Object, Object> undirected() { return new NetworkBuilder<>(false);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
requireNonNull(nodeConnections.getWithoutCaching(successor)).removePredecessor(node); requireNonNull(connections.removeSuccessor(successor)); --edgeCount; } if (isDirected()) { // In undirected graphs, the successor and predecessor sets are equal. // Since views are returned, we need to copy the predecessors that will be removed. // Thus we avoid modifying the underlying view while iterating over it.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Oct 21 01:50:30 GMT 2023 - 6.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
} private static MutableNetwork<Integer, String> createNetwork(EdgeType edgeType) { switch (edgeType) { case UNDIRECTED: return NetworkBuilder.undirected().allowsSelfLoops(true).build(); case DIRECTED: return NetworkBuilder.directed().allowsSelfLoops(true).build(); default: throw new IllegalStateException("Unexpected edge type: " + edgeType); } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 5.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ImmutableValueGraphTest.java
ImmutableValueGraph<String, Integer> emptyGraph = ValueGraphBuilder.directed() .allowsSelfLoops(true) .nodeOrder(ElementOrder.<String>natural()) .<String, Integer>immutable() .build(); assertThat(emptyGraph.isDirected()).isTrue(); assertThat(emptyGraph.allowsSelfLoops()).isTrue();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jan 09 20:24:43 GMT 2020 - 6.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphPropertiesTest.java
Network<Integer, String> undirectedNetwork; @Before public void init() { MutableGraph<Integer> mutableDirectedGraph = GraphBuilder.directed().allowsSelfLoops(true).build(); MutableGraph<Integer> mutableUndirectedGraph = GraphBuilder.undirected().allowsSelfLoops(true).build(); graphsToTest = ImmutableList.of(mutableDirectedGraph, mutableUndirectedGraph); directedGraph = mutableDirectedGraph;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 07 15:09:01 GMT 2016 - 5.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
MutableGraph<String> graph = GraphBuilder.directed().build(); graph.putEdge("a", "b"); Traverser.forTree(graph); // Does not throw } @Test public void forTree_withUndirectedGraph_throws() throws Exception { MutableGraph<String> graph = GraphBuilder.undirected().build(); graph.putEdge("a", "b");
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
private static final int NODE_POOL_SIZE = 1000; // must be >> NUM_NODES @Test public void directedGraph() { testGraphMutation(GraphBuilder.directed()); } @Test public void undirectedGraph() { testGraphMutation(GraphBuilder.undirected()); } private static void testGraphMutation(GraphBuilder<? super Integer> graphBuilder) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/PackageSanityTests.java
private static final ImmutableNetwork<String, String> IMMUTABLE_NETWORK_B = NetworkBuilder.directed().<String, String>immutable().addNode("B").build(); public PackageSanityTests() { MutableNetwork<String, String> mutableNetworkA = NetworkBuilder.directed().build(); mutableNetworkA.addNode("a"); MutableNetwork<String, String> mutableNetworkB = NetworkBuilder.directed().build();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 19:24:25 GMT 2023 - 3.2K bytes - Viewed (0)