|
@@ -93,15 +93,15 @@ public class PathTest {
|
93
|
93
|
assertFalse(longLoopPath.isEmpty());
|
94
|
94
|
assertFalse(invalidPath.isEmpty());
|
95
|
95
|
}
|
96
|
|
-
|
|
96
|
+
|
97
|
97
|
@Test
|
98
|
98
|
public void testSize() {
|
99
|
|
- assertEquals(emptyPath.size(), 0);
|
100
|
|
- assertEquals(singleNodePath.size(), 1);
|
101
|
|
- assertEquals(shortPath.size(), 4);
|
102
|
|
- assertEquals(longPath.size(), 5);
|
103
|
|
- assertEquals(loopPath.size(), 5);
|
104
|
|
- assertEquals(longLoopPath.size(), 10);
|
|
99
|
+ assertEquals(0, emptyPath.size());
|
|
100
|
+ assertEquals(1, singleNodePath.size());
|
|
101
|
+ assertEquals(4, shortPath.size());
|
|
102
|
+ assertEquals(5, longPath.size());
|
|
103
|
+ assertEquals(5, loopPath.size());
|
|
104
|
+ assertEquals(10, longLoopPath.size());
|
105
|
105
|
}
|
106
|
106
|
|
107
|
107
|
@Test
|
|
@@ -118,41 +118,41 @@ public class PathTest {
|
118
|
118
|
|
119
|
119
|
@Test
|
120
|
120
|
public void testGetLength() {
|
121
|
|
- assertEquals(emptyPath.getLength(), 0, 1e-6);
|
122
|
|
- assertEquals(singleNodePath.getLength(), 0, 1e-6);
|
123
|
|
- assertEquals(shortPath.getLength(), 40, 1e-6);
|
124
|
|
- assertEquals(longPath.getLength(), 62.8, 1e-6);
|
125
|
|
- assertEquals(loopPath.getLength(), 55, 1e-6);
|
126
|
|
- assertEquals(longLoopPath.getLength(), 120, 1e-6);
|
|
121
|
+ assertEquals(0, emptyPath.getLength(), 1e-6);
|
|
122
|
+ assertEquals(0, singleNodePath.getLength(), 1e-6);
|
|
123
|
+ assertEquals(40, shortPath.getLength(), 1e-6);
|
|
124
|
+ assertEquals(62.8, longPath.getLength(), 1e-6);
|
|
125
|
+ assertEquals(55, loopPath.getLength(), 1e-6);
|
|
126
|
+ assertEquals(120, longLoopPath.getLength(), 1e-6);
|
127
|
127
|
}
|
128
|
128
|
|
129
|
129
|
@Test
|
130
|
130
|
public void testGetTravelTime() {
|
131
|
131
|
// Note: 18 km/h = 5m/s
|
132
|
|
- assertEquals(emptyPath.getTravelTime(18), 0, 1e-6);
|
133
|
|
- assertEquals(singleNodePath.getTravelTime(18), 0, 1e-6);
|
134
|
|
- assertEquals(shortPath.getTravelTime(18), 8, 1e-6);
|
135
|
|
- assertEquals(longPath.getTravelTime(18), 12.56, 1e-6);
|
136
|
|
- assertEquals(loopPath.getTravelTime(18), 11, 1e-6);
|
137
|
|
- assertEquals(longLoopPath.getTravelTime(18), 24, 1e-6);
|
|
132
|
+ assertEquals(0, emptyPath.getTravelTime(18), 1e-6);
|
|
133
|
+ assertEquals(0, singleNodePath.getTravelTime(18), 1e-6);
|
|
134
|
+ assertEquals(8, shortPath.getTravelTime(18), 1e-6);
|
|
135
|
+ assertEquals(12.56, longPath.getTravelTime(18), 1e-6);
|
|
136
|
+ assertEquals(11, loopPath.getTravelTime(18), 1e-6);
|
|
137
|
+ assertEquals(24, longLoopPath.getTravelTime(18), 1e-6);
|
138
|
138
|
|
139
|
139
|
// Note: 28.8 km/h = 8m/s
|
140
|
|
- assertEquals(emptyPath.getTravelTime(28.8), 0, 1e-6);
|
141
|
|
- assertEquals(singleNodePath.getTravelTime(28.8), 0, 1e-6);
|
142
|
|
- assertEquals(shortPath.getTravelTime(28.8), 5, 1e-6);
|
143
|
|
- assertEquals(longPath.getTravelTime(28.8), 7.85, 1e-6);
|
144
|
|
- assertEquals(loopPath.getTravelTime(28.8), 6.875, 1e-6);
|
145
|
|
- assertEquals(longLoopPath.getTravelTime(28.8), 15, 1e-6);
|
|
140
|
+ assertEquals(0, emptyPath.getTravelTime(28.8), 1e-6);
|
|
141
|
+ assertEquals(0, singleNodePath.getTravelTime(28.8), 1e-6);
|
|
142
|
+ assertEquals(5, shortPath.getTravelTime(28.8), 1e-6);
|
|
143
|
+ assertEquals(7.85, longPath.getTravelTime(28.8), 1e-6);
|
|
144
|
+ assertEquals(6.875, loopPath.getTravelTime(28.8), 1e-6);
|
|
145
|
+ assertEquals(15, longLoopPath.getTravelTime(28.8), 1e-6);
|
146
|
146
|
}
|
147
|
147
|
|
148
|
148
|
@Test
|
149
|
149
|
public void testGetMinimumTravelTime() {
|
150
|
|
- assertEquals(emptyPath.getMinimumTravelTime(), 0, 1e-4);
|
151
|
|
- assertEquals(singleNodePath.getLength(), 0, 1e-4);
|
152
|
|
- assertEquals(shortPath.getMinimumTravelTime(), 4, 1e-4);
|
153
|
|
- assertEquals(longPath.getMinimumTravelTime(), 5.14, 1e-4);
|
154
|
|
- assertEquals(loopPath.getMinimumTravelTime(), 5.5, 1e-4);
|
155
|
|
- assertEquals(longLoopPath.getMinimumTravelTime(), 11.25, 1e-4);
|
|
150
|
+ assertEquals(0, emptyPath.getMinimumTravelTime(), 1e-4);
|
|
151
|
+ assertEquals(0, singleNodePath.getLength(), 1e-4);
|
|
152
|
+ assertEquals(4, shortPath.getMinimumTravelTime(), 1e-4);
|
|
153
|
+ assertEquals(5.14, longPath.getMinimumTravelTime(), 1e-4);
|
|
154
|
+ assertEquals(5.5, loopPath.getMinimumTravelTime(), 1e-4);
|
|
155
|
+ assertEquals(11.25, longLoopPath.getMinimumTravelTime(), 1e-4);
|
156
|
156
|
}
|
157
|
157
|
|
158
|
158
|
@Test
|
|
@@ -180,13 +180,13 @@ public class PathTest {
|
180
|
180
|
|
181
|
181
|
// Trap construction!
|
182
|
182
|
path = Path.createFastestPathFromNodes(graph, Arrays.asList(new Node[] { nodes[1] }));
|
183
|
|
- assertEquals(path.getOrigin(), nodes[1]);
|
184
|
|
- assertEquals(path.getArcs().size(), 0);
|
|
183
|
+ assertEquals(nodes[1], path.getOrigin());
|
|
184
|
+ assertEquals(0, path.getArcs().size());
|
185
|
185
|
|
186
|
186
|
// Trap construction - The return!
|
187
|
187
|
path = Path.createFastestPathFromNodes(graph, Arrays.asList(new Node[0]));
|
188
|
|
- assertEquals(path.getOrigin(), null);
|
189
|
|
- assertEquals(path.getArcs().size(), 0);
|
|
188
|
+ assertEquals(null, path.getOrigin());
|
|
189
|
+ assertEquals(0, path.getArcs().size());
|
190
|
190
|
assertTrue(path.isEmpty());
|
191
|
191
|
}
|
192
|
192
|
|
|
@@ -215,13 +215,13 @@ public class PathTest {
|
215
|
215
|
|
216
|
216
|
// Trap construction!
|
217
|
217
|
path = Path.createShortestPathFromNodes(graph, Arrays.asList(new Node[] { nodes[1] }));
|
218
|
|
- assertEquals(path.getOrigin(), nodes[1]);
|
219
|
|
- assertEquals(path.getArcs().size(), 0);
|
|
218
|
+ assertEquals(nodes[1], path.getOrigin());
|
|
219
|
+ assertEquals(0, path.getArcs().size());
|
220
|
220
|
|
221
|
221
|
// Trap construction - The return!
|
222
|
222
|
path = Path.createShortestPathFromNodes(graph, Arrays.asList(new Node[0]));
|
223
|
|
- assertEquals(path.getOrigin(), null);
|
224
|
|
- assertEquals(path.getArcs().size(), 0);
|
|
223
|
+ assertEquals(null, path.getOrigin());
|
|
224
|
+ assertEquals(0, path.getArcs().size());
|
225
|
225
|
assertTrue(path.isEmpty());
|
226
|
226
|
}
|
227
|
227
|
|