Partitions a list of students into rooms based on alphabetical order by last name, without exceeding the room capacities.

Brute-force checks all possible permutations of rooms, greedily assigning students to the rooms in order until all valid partitions are found. If no partition is possible, the algorithm greedily expands the room capacities by 1 until a valid solution is found. This isn't the most efficient algorithm, but since the number of rooms is small, it's good enough.

Usage: room_partitions.py [--scale SCALE] [--sort {avg,max,-avg,-max}] [--limit LIMIT] student_csv room_csv

• student_csv: a CSV file of student information, with a Name column for student names.

  The names should be of the form "Last, First"; it's easiest to get the CSV exported directly from CalCentral and referenced here.

• room_csv: a CVS file with the columns Room and Capacity, to specify the different rooms and their respective capacities.

  By default, this script will fill capacities as given, but the --scale parameter can be used to scale down the capacities (ex. if you desire to only fill to half capacity)

• --scale <float>: used to modify the capacities; for example, use --scale 0.5 to only fill rooms to half capacity.

• --sort avg|max|-avg|-max: used to order the list of matchings.

  Use --sort avg to sort by average fullness across all rooms (from lowest to highest). Use --sort max to sort by maximum fullness across all rooms (from lowest to highest).

  The sort options prepended with - reverses the sorting order (i.e. from highest to lowest). Note that you must specify these reversed sorts as --sort=-avg (with the equals sign required) due to argument parsing ambiguities.

• --limit <int>: used to limit the number of solutions returned.