-
Notifications
You must be signed in to change notification settings - Fork 0
/
Frontier.java
68 lines (56 loc) · 1.98 KB
/
Frontier.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
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
import java.util.ArrayList;
class Frontier {
private ArrayList<SearchPath> pathsInFrontier;
public int expansionOperations = 0;
public int maxNodesInFrontier = 1;
Frontier(SearchPath path) {
pathsInFrontier = new ArrayList<SearchPath>();
pathsInFrontier.add(path);
expansionOperations++;
}
void addPathToFrontier(SearchPath path) {
pathsInFrontier.add(path);
expansionOperations++;
int possibleMax = 0;
for(SearchPath p : pathsInFrontier){
possibleMax = possibleMax + p.getPathLength();
}
if(possibleMax > maxNodesInFrontier){
maxNodesInFrontier = possibleMax;
}
}
void removePathFromFrontier(SearchPath path) {
pathsInFrontier.remove(path);
}
void removeLastEntry() {
pathsInFrontier.remove(pathsInFrontier.size() - 1);
}
void removeFirstEntry(){
pathsInFrontier.remove(0);
}
public SearchPath getFirstEntry(){
return pathsInFrontier.get(0);
}
//returns the number of paths in the frontier
int getFrontierSize() {
return pathsInFrontier.size();
}
//returns the path at the end of the frontier
SearchPath getCurrentPath() {
return pathsInFrontier.get(pathsInFrontier.size() - 1);
}
boolean isEmpty() {
return pathsInFrontier.isEmpty();
}
ArrayList<SearchPath> getCurrentFrontier(){
return pathsInFrontier;
}
public String toString() {
String frontierToString = "[ ";
for (SearchPath path : pathsInFrontier) {
frontierToString = frontierToString.concat(path.toString() + " ");
}
frontierToString = frontierToString.concat("]");
return frontierToString;
}
}