Graph-coloring for course scheduling — A comparative analysis based on course selection order

The graph-coloring algorithm for scheduling courses to time-room slots is implemented using a 3-way approach that varies the selection order of courses to serve. The results are then contrasted and compared for completeness and time-efficiency. The approach utilizes Conflict Matrices that are used as input for the coloring algorithm in order to produce colored groups of compatible courses. The different sorting styles are analyzed to select the optimum approach include standard (alphabetical) such that the course with least conflicts is selected first, by Conflict_Weight and by Conflict_Weight Descending such that the course with most conflicts is selected first.