![]() Is valid if the nodes are different sections of the lecture/tutorial/practical of the same course. The 3 nodes are siblings to each other and the 20 nodes are also siblings to each other. ![]() Node contains the information of a section which is course name, course time, section number and location.įor example, if MAT137Y1(Calculus I) course has 3 lecture sections and 20 tutorial sections, then for this course, the algorithm generates 3 nodes for the lecture sections and 20 nodes for the tutorial sections. Node is an abstract object to represent a section of one course lecture/tutorial/practical. Intuitively, we build a graph of nodes to generate the timetable schedules. In the end, we decided to build our own algorithm, and we explain it in detail below. ![]() An algorithm that involves generating all timetables is slow, and definitely a bad choice on mobile devices, many of which are running with very little memory to spare already. We discovered that it was hard to find an existing algorithm that made the best possible timetable without generating all possible timetables first.
0 Comments
Leave a Reply. |