1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
/*
* Copyright (C) 2014 The Guava Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.google.common.graph;
import static com.google.common.truth.Truth.assertThat;
import static org.junit.Assert.assertTrue;
import static org.junit.Assert.fail;
import java.util.Set;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.junit.runners.JUnit4;
/**
* Tests for an undirected {@link ConfigurableMutableGraph}, creating a simple undirected graph
* (self-loop edges are not allowed).
*/
@RunWith(JUnit4.class)
public class ConfigurableSimpleUndirectedGraphTest extends AbstractUndirectedGraphTest {
@Override
public MutableGraph<Integer> createGraph() {
return GraphBuilder.undirected().allowsSelfLoops(false).build();
}
@Override
@Test
public void nodes_checkReturnedSetMutability() {
Set<Integer> nodes = graph.nodes();
try {
nodes.add(N2);
fail(ERROR_MODIFIABLE_SET);
} catch (UnsupportedOperationException e) {
addNode(N1);
assertThat(graph.nodes()).containsExactlyElementsIn(nodes);
}
}
@Override
@Test
public void adjacentNodes_checkReturnedSetMutability() {
addNode(N1);
Set<Integer> adjacentNodes = graph.adjacentNodes(N1);
try {
adjacentNodes.add(N2);
fail(ERROR_MODIFIABLE_SET);
} catch (UnsupportedOperationException e) {
putEdge(N1, N2);
assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes);
}
}
@Override
@Test
public void predecessors_checkReturnedSetMutability() {
addNode(N2);
Set<Integer> predecessors = graph.predecessors(N2);
try {
predecessors.add(N1);
fail(ERROR_MODIFIABLE_SET);
} catch (UnsupportedOperationException e) {
putEdge(N1, N2);
assertThat(graph.predecessors(N2)).containsExactlyElementsIn(predecessors);
}
}
@Override
@Test
public void successors_checkReturnedSetMutability() {
addNode(N1);
Set<Integer> successors = graph.successors(N1);
try {
successors.add(N2);
fail(ERROR_MODIFIABLE_SET);
} catch (UnsupportedOperationException e) {
putEdge(N1, N2);
assertThat(graph.successors(N1)).containsExactlyElementsIn(successors);
}
}
@Override
@Test
public void incidentEdges_checkReturnedSetMutability() {
addNode(N1);
Set<EndpointPair<Integer>> incidentEdges = graph.incidentEdges(N1);
try {
incidentEdges.add(EndpointPair.unordered(N1, N2));
fail(ERROR_MODIFIABLE_SET);
} catch (UnsupportedOperationException e) {
putEdge(N1, N2);
assertThat(incidentEdges).containsExactlyElementsIn(graph.incidentEdges(N1));
}
}
// Element Mutation
@Test
public void addEdge_selfLoop() {
try {
putEdge(N1, N1);
fail(ERROR_ADDED_SELF_LOOP);
} catch (IllegalArgumentException e) {
assertThat(e.getMessage()).contains(ERROR_SELF_LOOP);
}
}
/**
* This test checks an implementation dependent feature. It tests that the method {@code addEdge}
* will silently add the missing nodes to the graph, then add the edge connecting them. We are not
* using the proxy methods here as we want to test {@code addEdge} when the end-points are not
* elements of the graph.
*/
@Test
public void addEdge_nodesNotInGraph() {
graph.addNode(N1);
assertTrue(graph.putEdge(N1, N5));
assertTrue(graph.putEdge(N4, N1));
assertTrue(graph.putEdge(N2, N3));
assertThat(graph.nodes()).containsExactly(N1, N5, N4, N2, N3).inOrder();
assertThat(graph.adjacentNodes(N1)).containsExactly(N4, N5);
assertThat(graph.adjacentNodes(N2)).containsExactly(N3);
assertThat(graph.adjacentNodes(N3)).containsExactly(N2);
assertThat(graph.adjacentNodes(N4)).containsExactly(N1);
assertThat(graph.adjacentNodes(N5)).containsExactly(N1);
}
}
|
