-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTraversalTest.java
More file actions
141 lines (122 loc) · 3.73 KB
/
Copy pathTraversalTest.java
File metadata and controls
141 lines (122 loc) · 3.73 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
package graph;
import org.junit.Test;
import java.util.ArrayList;
import static junit.framework.TestCase.assertEquals;
public class TraversalTest {
private class DFSClient extends DepthFirstTraversal {
/** A constructor. */
protected DFSClient(Graph G) {
super(G);
_record = new ArrayList<Integer>();
}
@Override
protected boolean visit(int v) {
_record.add(v);
return true;
}
@Override
protected boolean shouldPostVisit(int v) {
return false;
}
public ArrayList<Integer> getRecord() {
return _record;
}
/** Visited record. */
private ArrayList<Integer> _record;
}
private class BFSClient extends BreadthFirstTraversal {
/** A constructor. */
protected BFSClient(Graph G) {
super(G);
_record = new ArrayList<Integer>();
}
@Override
protected boolean visit(int v) {
_record.add(v);
return true;
}
public ArrayList<Integer> getRecord() {
return _record;
}
/** Visited record. */
private ArrayList<Integer> _record;
}
private class DFSPostClient extends DepthFirstTraversal {
protected DFSPostClient(Graph G) {
super(G);
_G = G;
_record = new ArrayList<Integer>();
}
@Override
protected boolean postVisit(int v) {
_record.add(v);
return true;
}
public ArrayList<Integer> getRecord() {
return _record;
}
/** Visited record. */
ArrayList<Integer> _record;
/** The graph being traversed. */
private Graph _G;
}
@Test
public void testClientTraversal() {
DirectedGraph g = new DirectedGraph();
g.add();
g.add();
g.add();
g.add();
g.add();
g.add(5, 4);
g.add(5, 3);
g.add(4, 1);
g.add(3, 2);
g.add(1, 5);
DFSClient dfsClient = new DFSClient(g);
BFSClient bfsClient = new BFSClient(g);
DFSPostClient dfsPostClient = new DFSPostClient(g);
dfsClient.traverse(5);
bfsClient.traverse(5);
dfsPostClient.traverse(5);
ArrayList<Integer> dfsVisited = dfsClient.getRecord();
ArrayList<Integer> dfsExpected = new ArrayList<Integer>();
dfsExpected.add(5);
dfsExpected.add(4);
dfsExpected.add(1);
dfsExpected.add(3);
dfsExpected.add(2);
ArrayList<Integer> bfsVisited = bfsClient.getRecord();
ArrayList<Integer> bfsExpected = new ArrayList<Integer>();
bfsExpected.add(5);
bfsExpected.add(3);
bfsExpected.add(4);
bfsExpected.add(2);
bfsExpected.add(1);
ArrayList<Integer> dfsPostVisited = dfsPostClient.getRecord();
ArrayList<Integer> dfsPostExpected = new ArrayList<Integer>();
dfsPostExpected.add(1);
dfsPostExpected.add(4);
dfsPostExpected.add(2);
dfsPostExpected.add(3);
dfsPostExpected.add(5);
assertEquals(true, dfsVisited.equals(dfsExpected));
assertEquals(true, bfsVisited.equals(bfsExpected));
assertEquals(true, dfsPostVisited.equals(dfsPostExpected));
DirectedGraph g1 = new DirectedGraph();
g1.add();
g1.add();
g1.add();
g1.add();
g1.add(1, 2);
g1.add(2, 4);
g1.add(2, 3);
g1.add(3, 3);
g1.add(4, 2);
g1.add(4, 1);
DFSClient dfsClient2 = new DFSClient(g1);
BFSClient bfsClient2 = new BFSClient(g1);
dfsClient2.traverse(2);
bfsClient2.traverse(2);
}
}