Parser now returns "arbitrary" sections as their raw markup. These sections cannot be converted into data to be suggested. Now they will still show up to the user, so they can reference them while planning their schedule.
Parser identifies all non-arbitrary course lists, including selections (ORs) and groups (ANDs), as well as sometimes-arbitrary complementary sections where a course list immediately follows a subheader that is associated with it.
The homepage now presents a form for students to select their (1) degree program, (2) core reqs. satisfied, (3) major reqs. satisfied, and (4) extra filters to be applied before schedules are suggested.
The next major effort will be to store the requirements selected by the user, and then to implement the suggestion algorithm by cross-referencing all of the classes not selected (i.e. not yet taken) with the public SCU IT API. The algorithm will search for each of those classes, identify available sections, and attempt to combine sections that do not overlap, and fit within a specified range of units.
This update introduces several major changes:
Parser now returns "arbitrary" sections as their raw markup. These sections cannot be converted into data to be suggested. Now they will still show up to the user, so they can reference them while planning their schedule.
Parser identifies all non-arbitrary course lists, including selections (ORs) and groups (ANDs), as well as sometimes-arbitrary complementary sections where a course list immediately follows a subheader that is associated with it.
The homepage now presents a form for students to select their (1) degree program, (2) core reqs. satisfied, (3) major reqs. satisfied, and (4) extra filters to be applied before schedules are suggested.
The next major effort will be to store the requirements selected by the user, and then to implement the suggestion algorithm by cross-referencing all of the classes not selected (i.e. not yet taken) with the public SCU IT API. The algorithm will search for each of those classes, identify available sections, and attempt to combine sections that do not overlap, and fit within a specified range of units.