forked from davecom/ClassicComputerScienceProblemsInJava
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMapColoringConstraint.java
More file actions
70 lines (63 loc) · 2.83 KB
/
MapColoringConstraint.java
File metadata and controls
70 lines (63 loc) · 2.83 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
// MapColoringContraint.java
// From Classic Computer Science Problems in Java Chapter 3
// Copyright 2020 David Kopec
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package chapter3;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public final class MapColoringConstraint extends Constraint<String, String> {
private String place1, place2;
public MapColoringConstraint(String place1, String place2) {
super(List.of(place1, place2));
this.place1 = place1;
this.place2 = place2;
}
@Override
public boolean satisfied(Map<String, String> assignment) {
// if either place is not in the assignment, then it is not
// yet possible for their colors to be conflicting
if (!assignment.containsKey(place1) || !assignment.containsKey(place2)) {
return true;
}
// check the color assigned to place1 is not the same as the
// color assigned to place2
return !assignment.get(place1).equals(assignment.get(place2));
}
public static void main(String[] args) {
List<String> variables = List.of("Western Australia", "Northern Territory",
"South Australia", "Queensland", "New South Wales", "Victoria", "Tasmania");
Map<String, List<String>> domains = new HashMap<>();
for (String variable : variables) {
domains.put(variable, List.of("red", "green", "blue"));
}
CSP<String, String> csp = new CSP<>(variables, domains);
csp.addConstraint(new MapColoringConstraint("Western Australia", "Northern Territory"));
csp.addConstraint(new MapColoringConstraint("Western Australia", "South Australia"));
csp.addConstraint(new MapColoringConstraint("South Australia", "Northern Territory"));
csp.addConstraint(new MapColoringConstraint("Queensland", "Northern Territory"));
csp.addConstraint(new MapColoringConstraint("Queensland", "South Australia"));
csp.addConstraint(new MapColoringConstraint("Queensland", "New South Wales"));
csp.addConstraint(new MapColoringConstraint("New South Wales", "South Australia"));
csp.addConstraint(new MapColoringConstraint("Victoria", "South Australia"));
csp.addConstraint(new MapColoringConstraint("Victoria", "New South Wales"));
csp.addConstraint(new MapColoringConstraint("Victoria", "Tasmania"));
Map<String, String> solution = csp.backtrackingSearch();
if (solution == null) {
System.out.println("No solution found!");
} else {
System.out.println(solution);
}
}
}