@@ -39,46 +39,46 @@ void setUp() {
39
39
graph .addEdge (Point .A , Point .C , 12 );
40
40
assertThat (graph .showGraphEdgeInfo ()).isEqualTo ("A: B C\n B: A C\n C: B A\n " );
41
41
assertThat (graph .showGraphEdgeWeightInfo ())
42
- .isEqualTo ("(A-B ), w: 9 \n (B-C ), w: 2 \n (A -C), w: 12 \n " );
42
+ .isEqualTo ("(A-C ), w: 12 \n (A-B ), w: 9 \n (B -C), w: 2 \n " );
43
43
44
44
graph .addEdge (Point .A , Point .D , 8 );
45
45
assertThat (graph .showGraphEdgeInfo ()).isEqualTo ("A: B C D\n B: A C\n C: B A\n D: A\n " );
46
46
assertThat (graph .showGraphEdgeWeightInfo ())
47
- .isEqualTo ("(A-B ), w: 9 \n (B-C ), w: 2 \n (A-C ), w: 12 \n (A-D ), w: 8 \n " );
47
+ .isEqualTo ("(A-C ), w: 12 \n (A-B ), w: 9 \n (A-D ), w: 8 \n (B-C ), w: 2 \n " );
48
48
49
49
graph .addEdge (Point .D , Point .C , 6 );
50
50
assertThat (graph .showGraphEdgeInfo ()).isEqualTo ("A: B C D\n B: A C\n C: B A D\n D: A C\n " );
51
51
assertThat (graph .showGraphEdgeWeightInfo ())
52
- .isEqualTo ("(A-B ), w: 9 \n (B-C ), w: 2 \n (A-C ), w: 12 \n (A-D ), w: 8 \n (D -C), w: 6 \n " );
52
+ .isEqualTo ("(A-C ), w: 12 \n (A-B ), w: 9 \n (A-D ), w: 8 \n (D-C ), w: 6 \n (B -C), w: 2 \n " );
53
53
54
54
graph .addEdge (Point .A , Point .F , 11 );
55
55
assertThat (graph .showGraphEdgeInfo ()).isEqualTo ("A: B C D F\n B: A C\n C: B A D\n D: A C\n F: A\n " );
56
56
assertThat (graph .showGraphEdgeWeightInfo ()).isEqualTo (
57
- "(A-B ), w: 9 \n (B-C ), w: 2 \n (A-C ), w: 12 \n (A-D), w: 8\n (D-C), w: 6\n (A-F ), w: 11 \n " );
57
+ "(A-C ), w: 12 \n (A-F ), w: 11 \n (A-B ), w: 9 \n (A-D), w: 8\n (D-C), w: 6\n (B-C ), w: 2 \n " );
58
58
59
59
graph .addEdge (Point .F , Point .D , 4 );
60
60
assertThat (graph .showGraphEdgeInfo ())
61
61
.isEqualTo ("A: B C D F\n B: A C\n C: B A D\n D: A C F\n F: A D\n " );
62
62
assertThat (graph .showGraphEdgeWeightInfo ()).isEqualTo (
63
- "(A-B ), w: 9 \n (B-C ), w: 2 \n (A-C ), w: 12 \n (A-D), w: 8\n (D-C), w: 6\n (A-F ), w: 11 \n (F-D ), w: 4 \n " );
63
+ "(A-C ), w: 12 \n (A-F ), w: 11 \n (A-B ), w: 9 \n (A-D), w: 8\n (D-C), w: 6\n (F-D ), w: 4 \n (B-C ), w: 2 \n " );
64
64
65
65
graph .addEdge (Point .D , Point .E , 3 );
66
66
assertThat (graph .showGraphEdgeInfo ())
67
67
.isEqualTo ("A: B C D F\n B: A C\n C: B A D\n D: A C F E\n E: D\n F: A D\n " );
68
68
assertThat (graph .showGraphEdgeWeightInfo ()).isEqualTo (
69
- "(A-B ), w: 9 \n (B-C ), w: 2 \n (A-C ), w: 12 \n (A-D), w: 8\n (D-C), w: 6\n (A-F ), w: 11 \n (F-D ), w: 4 \n (D-E ), w: 3 \n " );
69
+ "(A-C ), w: 12 \n (A-F ), w: 11 \n (A-B ), w: 9 \n (A-D), w: 8\n (D-C), w: 6\n (F-D ), w: 4 \n (D-E ), w: 3 \n (B-C ), w: 2 \n " );
70
70
71
71
graph .addEdge (Point .E , Point .C , 7 );
72
72
assertThat (graph .showGraphEdgeInfo ())
73
73
.isEqualTo ("A: B C D F\n B: A C\n C: B A D E\n D: A C F E\n E: D C\n F: A D\n " );
74
74
assertThat (graph .showGraphEdgeWeightInfo ()).isEqualTo (
75
- "(A-B ), w: 9 \n (B-C ), w: 2 \n (A-C ), w: 12 \n (A-D), w: 8\n (D -C), w: 6 \n (A-F ), w: 11 \n (F-D), w: 4\n (D-E), w: 3\n (E -C), w: 7 \n " );
75
+ "(A-C ), w: 12 \n (A-F ), w: 11 \n (A-B ), w: 9 \n (A-D), w: 8\n (E -C), w: 7 \n (D-C ), w: 6 \n (F-D), w: 4\n (D-E), w: 3\n (B -C), w: 2 \n " );
76
76
77
77
graph .addEdge (Point .F , Point .E , 13 );
78
78
assertThat (graph .showGraphEdgeInfo ())
79
79
.isEqualTo ("A: B C D F\n B: A C\n C: B A D E\n D: A C F E\n E: D C F\n F: A D E\n " );
80
80
assertThat (graph .showGraphEdgeWeightInfo ()).isEqualTo (
81
- "(A-B ), w: 9 \n (B -C), w: 2 \n (A-C ), w: 12 \n (A-D), w: 8\n (D -C), w: 6 \n (A-F ), w: 11 \n (F-D), w: 4\n (D-E), w: 3\n (E -C), w: 7 \n (F-E), w: 13 \n " );
81
+ "(F-E ), w: 13 \n (A -C), w: 12 \n (A-F ), w: 11 \n (A-B), w: 9 \n (A- D), w: 8\n (E -C), w: 7 \n (D-C ), w: 6 \n (F-D), w: 4\n (D-E), w: 3\n (B -C), w: 2 \n " );
82
82
}
83
83
84
84
@ Test
0 commit comments