v1.3.0 SR, SMT Strong, SPAST Super

This release implements:

1. the algorithm due to Irving for the stable roommate problem (SR), allowing for incomplete lists (SRI).

2. the algorithm due to Manlove for the stable marriage problem with ties (SMT) which finds a strongly stable matching. Both man-optimal and woman-optimal solutions are available.

3. the algorithm for the student-project allocation problem (SPA) with lecturer preferences over students and ties in the preference lists (SPA-ST) due to Olaosebikan which finds a student-optimal super-stable matching. The lecturer-optimal algorithm for SPA-ST Super does not exist in the literature at this time.

What's Changed

• 40 check stability refactoring by @BenOnTheBoard in #77
• Adds an implementation of SMT Strong by @BenOnTheBoard in #87
• 88 hr generic bruteforcer bug by @BenOnTheBoard in #8
• 78 stable roommates by @BenOnTheBoard in #91
• 83 spa st super by @BenOnTheBoard in #92

Full Changelog: v1.2.0...v1.3.0