algorithm

[yuuwe-n]

The general education requirement will be found, the algo will find best teachers for each requirement. The algo will take into account the weight of others. The goal is to find best courses/teachers for a student. The weight will based off for now the rating of the teacher (number of ratings may affect it later on).

Plans for using dijkstra's algorithm to find teachers in the same department and find courses in pathway with best weight. Each graph will contain a department's courses, each node containing the teacher and the connections are the weights. The nodes that connect with the most weight, will be returned for that GE requirement.

I am not sure why we cant just get the GE requirement, and return the teacher with the highest rating in that course requirement. Since courses fuffill many GE requirements, isnt it gonna be kind of messy.

[yuuwe-n]

algo is for series of classes, map for each series of classes hopefully saves time instead of iterating for each professor for highest rating

for one off classes, we just find highest rating

[yuuwe-n]

change to model, we will have this a WIP, for later, and have this for when we get GE requirements/major requirements working

we could not get GE requirements because of PDF permission issues.