- Sort Score
- Num 10 results
- Language All
Results 1 - 3 of 3 for edges_selfLoop (0.06 seconds)
-
guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
addEdge(N1, N2, E12); assertThat(network.outDegree(N1)).isEqualTo(1); // Edge direction handled correctly assertThat(network.outDegree(N2)).isEqualTo(0); } @Test public void edges_selfLoop() { assume().that(network.allowsSelfLoops()).isTrue(); addEdge(N1, N1, E11); assertThat(network.edges()).containsExactly(E11); } @Test public void incidentEdges_selfLoop() {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 30 17:09:51 GMT 2025 - 21.3K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
@Test public void outDegree_oneEdge() { addEdge(N1, N2, E12); assertThat(network.outDegree(N1)).isEqualTo(1); assertThat(network.outDegree(N2)).isEqualTo(1); } @Test public void edges_selfLoop() { assume().that(network.allowsSelfLoops()).isTrue(); addEdge(N1, N1, E11); assertThat(network.edges()).containsExactly(E11); } @Test public void incidentEdges_selfLoop() {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 30 17:09:51 GMT 2025 - 18.6K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
@Test public void outDegree_oneEdge() { addEdge(N1, N2, E12); assertThat(network.outDegree(N1)).isEqualTo(1); assertThat(network.outDegree(N2)).isEqualTo(1); } @Test public void edges_selfLoop() { assume().that(network.allowsSelfLoops()).isTrue(); addEdge(N1, N1, E11); assertThat(network.edges()).containsExactly(E11); } @Test public void incidentEdges_selfLoop() {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 30 17:09:51 GMT 2025 - 19K bytes - Click Count (0)