-
Notifications
You must be signed in to change notification settings - Fork 0
/
SearchPath.java
43 lines (36 loc) · 1.21 KB
/
SearchPath.java
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
import java.util.LinkedList;
class SearchPath {
protected LinkedList<Field> path;
//constructor for private class SearchPath, creates
//a new path with just one node in it
SearchPath(Field field) {
path = new LinkedList<>();
path.add(field);
}
Field getHeadNode() {
return path.getLast();
}
//@TODO: implement a way to check if this node is already in the frontier as head of another path
void addNode(Field field) {
path.add(field);
}
int getPathLength() {
return path.size();
}
protected SearchPath clone(){
SearchPath clone = new SearchPath(path.getFirst());
clone.path.clear();
for(Field f : path){
clone.addNode(f);
}
return clone;
}
public String toString() {
String searchPathToString = "<";
for (Field node : path) {
searchPathToString = searchPathToString.concat(node.toString());
}
searchPathToString = searchPathToString.concat(">");
return searchPathToString;
}
}