COMPUTING NETWORK NODE ADJUSTMENTS

摘要

A method of computing relative rankings for multiple course trajectories may include accessing a data structure. The data structure may include a first node that may represent a first course and a plurality of nodes that may represent courses that are available after completing the first course. Each of the plurality of nodes may be associated with a weight, and the plurality of nodes may include a second node representing a second course. The method may also include receiving a first grade for a student for the first course and receiving a second grade for the student for the second course. The method may additionally include adjusting the weight associated with the second node using the first grade and the second grade. The method may further include providing a ranking of the plurality of courses using the weights of the plurality of courses.

主权项

1. A method of computing relative rankings for multiple course trajectories, the method comprising:
accessing a data structure comprising: a first node representing a first course; and a plurality of nodes representing courses that are available after completing the first course, wherein: each of the plurality of nodes is associated with a weight; and the plurality of nodes comprises a second node representing a second course; receiving a first grade for a student for the first course; receiving a second grade for the student for the second course; adjusting the weight associated with the second node using the first grade and the second grade; and providing a ranking of the plurality of courses using the weights of the plurality of courses.