Repository for my 4th year university individual project.
-
Updated
Jul 15, 2026 - TypeScript
Repository for my 4th year university individual project.
This repository contains a Python implementation of the Stable Marriage Algorithm, a mechanism for solving the stable marriage problem. The algorithm is widely used in the field of matching theory to find a stable matching between two sets of elements, such as job applicants and employers or medical students and residency programs.
Optimal Selection of Training Courses for Unemployed People based on Stable Marriage Model
This repo contains the core foundational algos and data structures
Refined the Gale-Shapley algorithm by recalculating stable matchings in bipartite graphs, incorporating dynamic updates for edge deletions, achieving O(N) time complexity for edge deletions, enhancing computational efficiency.
Rust implementation of a modified stable matching problem.
The Process of College Selection Using Stable Matching Algorithm
Stable Big-Little Matching
Stable matching algorithm from "College Admissions and the Stability of Marriage" paper by Gale, D.; Shapley, L. S. (1962)
To associate your repository with the stable-matching-algorithm topic, visit your repo's landing page and select "manage topics."