Skip to content

Commit 3a0495c

Browse files
committed
test: bfs 테스트 코드 작성
1 parent 592b655 commit 3a0495c

File tree

1 file changed

+21
-6
lines changed

1 file changed

+21
-6
lines changed

yoonexample/src/test/java/graph/GraphTest.java

Lines changed: 21 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -42,19 +42,34 @@ void setUp() {
4242

4343
@Test
4444
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() {
4566
graph.addEdge(Point.A, Point.B);
4667
graph.addEdge(Point.A, Point.C);
4768
graph.addEdge(Point.A, Point.E);
4869
graph.addEdge(Point.B, Point.D);
4970
graph.addEdge(Point.B, Point.E);
5071
graph.addEdge(Point.C, Point.D);
5172
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");
5873
}
5974

6075
private enum Point {

0 commit comments

Comments
 (0)