- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for validateNetwork (0.09 sec)
-
guava-tests/test/com/google/common/graph/NetworkMutationTest.java
AbstractNetworkTest.validateNetwork(network); for (int i = numNodesToRemove; i < NUM_NODES; ++i) { assertThat(network.removeNode(nodeList.get(i))).isTrue(); } assertThat(network.nodes()).isEmpty(); assertThat(network.edges()).isEmpty(); // no edges can remain if there's no nodes AbstractNetworkTest.validateNetwork(network);Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 4.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
int edgeStart = graphString.indexOf("edges:"); String nodeString = graphString.substring(nodeStart, edgeStart); Network<N, EndpointPair<N>> asNetwork = graph.asNetwork(); // Don't call AbstractNetworkTest.validateNetwork(asNetwork). Mutual recursion. assertThat(graph.nodes()).isEqualTo(asNetwork.nodes()); assertThat(graph.edges()).hasSize(asNetwork.edges().size()); assertThat(graph.nodeOrder()).isEqualTo(asNetwork.nodeOrder());
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Oct 07 15:57:03 UTC 2025 - 17.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphsTest.java
Network<Integer, String> transpose = transpose(directedGraph); assertThat(transpose).isEqualTo(expectedTranspose); assertThat(transpose(transpose)).isSameInstanceAs(directedGraph); AbstractNetworkTest.validateNetwork(transpose); assertThat(transpose.edgesConnecting(N1, N2)).isEmpty(); assertThat(transpose.edgeConnecting(N1, N2)).isEmpty(); assertThat(transpose.edgeConnectingOrNull(N1, N2)).isNull();Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Sep 30 17:09:51 UTC 2025 - 30.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ValueGraphTest.java
assertThat(graph.allowsSelfLoops()).isEqualTo(asGraph.allowsSelfLoops()); Network<Integer, EndpointPair<Integer>> asNetwork = graph.asNetwork(); AbstractNetworkTest.validateNetwork(asNetwork); assertThat(graph.nodes()).isEqualTo(asNetwork.nodes()); assertThat(graph.edges()).hasSize(asNetwork.edges().size()); assertThat(graph.nodeOrder()).isEqualTo(asNetwork.nodeOrder());
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Oct 07 15:57:03 UTC 2025 - 18.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
int edgeStart = graphString.indexOf("edges:"); String nodeString = graphString.substring(nodeStart, edgeStart); Network<N, EndpointPair<N>> asNetwork = graph.asNetwork(); // Don't call AbstractNetworkTest.validateNetwork(asNetwork). Mutual recursion. assertThat(graph.nodes()).isEqualTo(asNetwork.nodes()); assertThat(graph.edges()).hasSize(asNetwork.edges().size()); assertThat(graph.nodeOrder()).isEqualTo(asNetwork.nodeOrder());
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Oct 07 15:57:03 UTC 2025 - 17.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ValueGraphTest.java
assertThat(graph.allowsSelfLoops()).isEqualTo(asGraph.allowsSelfLoops()); Network<Integer, EndpointPair<Integer>> asNetwork = graph.asNetwork(); AbstractNetworkTest.validateNetwork(asNetwork); assertThat(graph.nodes()).isEqualTo(asNetwork.nodes()); assertThat(graph.edges()).hasSize(asNetwork.edges().size()); assertThat(graph.nodeOrder()).isEqualTo(asNetwork.nodeOrder());
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Oct 07 15:57:03 UTC 2025 - 20.7K bytes - Viewed (0)