// Deze method checkt rooster conflicten (Dubbele roosteringen van studenten)
public int computeStudentConflicts() {
ArrayList<Student> checkedStudentsList = new ArrayList<Student>();
int studentConflictCounter = 0;
boolean conflictFound = false;
for (int i = 0; i < timeslots; i++) {
for (int j = 0; j < rooms.size() - 1; j++) {
Activity activity = rooms.get(j).timetable.get(i);
if (activity != null) {
for (Student student : activity.studentGroup) {
if (!checkedStudentsList.contains(student)) {
for (int k = j + 1; k < rooms.size(); k++) {
Room otherRoom = rooms.get(k);
Activity otherActivity = otherRoom.timetable.get(i);
if (otherActivity != null) {
if (otherActivity.studentGroup.contains(student)) {
studentConflictCounter++;
conflictFound = true;
}
}
}
}
if (conflictFound) {
checkedStudentsList.add(student);
conflictFound = false;
}
}
}
}
checkedStudentsList.clear();
}
return studentConflictCounter;
}
