@@ -42,19 +42,34 @@ void setUp() {
42
42
43
43
@ Test
44
44
void dfsTest () {
45
+ setVertices ();
46
+
47
+ assertThat (graph .depthFirstSearch (Point .A )).isEqualTo ("A E D C B" );
48
+ assertThat (graph .depthFirstSearch (Point .B )).isEqualTo ("B E D C A" );
49
+ assertThat (graph .depthFirstSearch (Point .C )).isEqualTo ("C D E B A" );
50
+ assertThat (graph .depthFirstSearch (Point .D )).isEqualTo ("D E B A C" );
51
+ assertThat (graph .depthFirstSearch (Point .E )).isEqualTo ("E D C A B" );
52
+ }
53
+
54
+ @ Test
55
+ void bfsTest () {
56
+ setVertices ();
57
+
58
+ assertThat (graph .breadthFirstSearch (Point .A )).isEqualTo ("A E B D C" );
59
+ assertThat (graph .breadthFirstSearch (Point .B )).isEqualTo ("B E D A C" );
60
+ assertThat (graph .breadthFirstSearch (Point .C )).isEqualTo ("C D A E B" );
61
+ assertThat (graph .breadthFirstSearch (Point .D )).isEqualTo ("D E C B A" );
62
+ assertThat (graph .breadthFirstSearch (Point .E )).isEqualTo ("E D B A C" );
63
+ }
64
+
65
+ private void setVertices () {
45
66
graph .addEdge (Point .A , Point .B );
46
67
graph .addEdge (Point .A , Point .C );
47
68
graph .addEdge (Point .A , Point .E );
48
69
graph .addEdge (Point .B , Point .D );
49
70
graph .addEdge (Point .B , Point .E );
50
71
graph .addEdge (Point .C , Point .D );
51
72
graph .addEdge (Point .D , Point .E );
52
-
53
- assertThat (graph .depthFirstSearch (Point .A )).isEqualTo ("A E D C B" );
54
- assertThat (graph .depthFirstSearch (Point .B )).isEqualTo ("B E D C A" );
55
- assertThat (graph .depthFirstSearch (Point .C )).isEqualTo ("C D E B A" );
56
- assertThat (graph .depthFirstSearch (Point .D )).isEqualTo ("D E B A C" );
57
- assertThat (graph .depthFirstSearch (Point .E )).isEqualTo ("E D C A B" );
58
73
}
59
74
60
75
private enum Point {
0 commit comments