28 std::vector<DiscreteKey> keys_;
29 std::vector<std::string> areaName_;
30 std::vector<double> advisor_;
31 Student(
size_t nrFaculty,
size_t advisorIndex)
32 : keys_(3), areaName_(3), advisor_(nrFaculty, 1.0) {
33 advisor_[advisorIndex] = 0.0;
37 cout << name_ <<
": ";
38 for (
size_t area = 0; area < 3; area++) cout << areaName_[area] <<
" ";
44 size_t maxNrStudents_;
47 std::vector<Student> students_;
50 std::map<std::string, size_t> facultyIndex_;
51 std::vector<std::string> facultyName_, slotName_, areaName_;
54 typedef std::map<std::string, std::vector<double> > FacultyInArea;
55 FacultyInArea facultyInArea_;
58 std::string available_;
61 std::vector<double> slotsAvailable_;
69 Scheduler(
size_t maxNrStudents) : maxNrStudents_(maxNrStudents) {}
74 void addFaculty(
const std::string& facultyName) {
75 facultyIndex_[facultyName] = nrFaculty();
76 facultyName_.push_back(facultyName);
79 size_t nrFaculty()
const {
return facultyName_.size(); }
84 void addSlot(
const std::string& slotName) { slotName_.push_back(slotName); }
86 size_t nrTimeSlots()
const {
return slotName_.size(); }
88 const std::string& slotName(
size_t s)
const {
return slotName_[s]; }
92 slotsAvailable_ = slotsAvailable;
95 void addArea(
const std::string& facultyName,
const std::string& areaName) {
96 areaName_.push_back(areaName);
97 std::vector<double>& table =
98 facultyInArea_[areaName];
99 if (table.empty()) table.resize(nrFaculty(), 0);
100 table[facultyIndex_[facultyName]] = 1;
107 Scheduler(
size_t maxNrStudents,
const std::string& filename);
110 const DiscreteKey& key(
size_t s,
111 boost::optional<size_t> area = boost::none)
const;
114 void addStudent(
const std::string& studentName,
const std::string& area1,
115 const std::string& area2,
const std::string& area3,
116 const std::string& advisor);
121 const std::string& studentName(
size_t i)
const;
123 const std::string& studentArea(
size_t i,
size_t area)
const;
126 void addStudentSpecificConstraints(
127 size_t i, boost::optional<size_t> slot = boost::none);
130 void buildGraph(
size_t mutexBound = 7);
134 const std::string& s =
"Scheduler",
135 const KeyFormatter& formatter = DefaultKeyFormatter)
const override;
145 std::vector<size_t>& stats)
const;
148 DiscreteBayesNet::shared_ptr eliminate()
const;
std::pair< Key, size_t > DiscreteKey
Key type for discrete variables.
Definition DiscreteKey.h:36
void print(const Matrix &A, const string &s, ostream &stream)
print without optional string, must specify cout yourself
Definition Matrix.cpp:156
Scheduler(size_t maxNrStudents)
Constructor We need to know the number of students in advance for ordering keys.
Definition Scheduler.h:69