SAT implementation of stable matching problem with couples and reference implementations of deferred acceptance algorithms.

An implementation of stable marriage problem in C++.

This is a Stable matching program that will take N men and N women and match them using the Gale–Shapley algorithm. This program runs in O(n^2) time.

A solver for 'College Admission Problem with Consent' based on paper 'Legal Assignments and fast EADAM with consent via classical theory of stable matchings'.

hey these are some college and senior secodary projects . hope you like it

2020 Forif Winter Hackathon - Irving's Algorithm for Stable Marrige Problem (in C++)

This repository contains a C++ implementation of the Stable Matching Algorithm which solves the Stable Matching Problem (known as the Stable Marriage Problem).

A cli tool for solving bipartite assignment problems.

Solutions to algorithmic programming problems.