1
- package org .opentripplanner .routing .core ;
1
+ package org .opentripplanner .routing .graph ;
2
2
3
3
import static org .junit .jupiter .api .Assertions .assertEquals ;
4
4
import static org .junit .jupiter .api .Assertions .assertNotNull ;
11
11
import org .locationtech .jts .geom .Coordinate ;
12
12
import org .locationtech .jts .geom .LineString ;
13
13
import org .opentripplanner .framework .geometry .GeometryUtils ;
14
- import org .opentripplanner .routing .graph .Graph ;
15
14
import org .opentripplanner .street .model .StreetTraversalPermission ;
16
15
import org .opentripplanner .street .model ._data .StreetModelForTest ;
17
16
import org .opentripplanner .street .model .edge .Edge ;
22
21
import org .opentripplanner .street .model .vertex .Vertex ;
23
22
import org .opentripplanner .street .model .vertex .VertexLabel ;
24
23
25
- public class GraphTest {
24
+ class GraphTest {
26
25
27
26
@ Test
28
- public void testBasic () {
27
+ void testBasic () {
29
28
Graph g = new Graph ();
30
29
assertNotNull (g );
31
30
}
32
31
33
32
@ Test
34
- public void testAddVertex () {
33
+ void testAddVertex () {
35
34
Vertex a = StreetModelForTest .intersectionVertex ("A" , 5 , 5 );
36
35
assertEquals (a .getLabel (), VertexLabel .string ("A" ));
37
36
}
38
37
39
38
@ Test
40
- public void testGetVertex () {
39
+ void testGetVertex () {
41
40
var g = new Graph ();
42
41
Vertex a = StreetModelForTest .intersectionVertex ("A" , 5 , 5 );
43
42
g .addVertex (a );
@@ -46,15 +45,15 @@ public void testGetVertex() {
46
45
}
47
46
48
47
@ Test
49
- public void testAddEdge () {
48
+ void testAddEdge () {
50
49
Vertex a = StreetModelForTest .intersectionVertex ("A" , 5 , 5 );
51
50
Vertex b = StreetModelForTest .intersectionVertex ("B" , 6 , 6 );
52
51
FreeEdge ee = FreeEdge .createFreeEdge (a , b );
53
52
assertNotNull (ee );
54
53
}
55
54
56
55
@ Test
57
- public void testGetEdgesOneEdge () {
56
+ void testGetEdgesOneEdge () {
58
57
Graph g = new Graph ();
59
58
Vertex a = StreetModelForTest .intersectionVertex ("A" , 5 , 5 );
60
59
Vertex b = StreetModelForTest .intersectionVertex ("B" , 6 , 6 );
@@ -70,7 +69,7 @@ public void testGetEdgesOneEdge() {
70
69
}
71
70
72
71
@ Test
73
- public void testGetEdgesMultiple () {
72
+ void testGetEdgesMultiple () {
74
73
Graph g = new Graph ();
75
74
Vertex a = StreetModelForTest .intersectionVertex ("A" , 5 , 5 );
76
75
Vertex b = StreetModelForTest .intersectionVertex ("B" , 6 , 6 );
@@ -92,7 +91,7 @@ public void testGetEdgesMultiple() {
92
91
}
93
92
94
93
@ Test
95
- public void testGetStreetEdgesNone () {
94
+ void testGetStreetEdgesNone () {
96
95
Graph g = new Graph ();
97
96
Vertex a = StreetModelForTest .intersectionVertex ("A" , 5 , 5 );
98
97
Vertex b = StreetModelForTest .intersectionVertex ("B" , 6 , 6 );
@@ -109,7 +108,7 @@ public void testGetStreetEdgesNone() {
109
108
}
110
109
111
110
@ Test
112
- public void testGetStreetEdgesSeveral () {
111
+ void testGetStreetEdgesSeveral () {
113
112
Graph g = new Graph ();
114
113
StreetVertex a = StreetModelForTest .intersectionVertex ("A" , 5 , 5 );
115
114
StreetVertex b = StreetModelForTest .intersectionVertex ("B" , 6 , 6 );
@@ -131,7 +130,7 @@ public void testGetStreetEdgesSeveral() {
131
130
}
132
131
133
132
@ Test
134
- public void testGetEdgesAndVerticesById () {
133
+ void testGetEdgesAndVerticesById () {
135
134
StreetVertex a = StreetModelForTest .intersectionVertex ("A" , 5 , 5 );
136
135
StreetVertex b = StreetModelForTest .intersectionVertex ("B" , 6 , 6 );
137
136
StreetVertex c = StreetModelForTest .intersectionVertex ("C" , 3 , 2 );
0 commit comments