Max flow algorithm before refactoring
Max flow algorithm refactored (working?)
Working max flow algorithm

Working for graphs that do actually have a perfect max flow
Minimum cover working

Added a way to create a test residual graph
Added matrix adjustment (untested)
Hungarian class working for small inputs

Tested with 3 teachers, 3 students
Speed assessment includes Hungarian

Not working: IndexOutOfBounds for student list when trying to populate
final assignments
Fixed bug in Hungarian

I wasn't clearing the flow network before each finding max matching
Tested how Hungarian scales