Prevent this user from interacting with your repositories and sending you notifications.
Learn more about blocking users.
You must be logged in to block users.
Contact GitHub support about this user’s behavior.
Learn more about reporting abuse.
a module to find a maximum matching in bipartite graphs
a program to assign students to courses for presentation at AIMS-Ghana, 2015.
An implementation of an algorithm to find a super-stable matching or to report that no such matching exists, given an instance of the Student-Project Allocation problem with Ties (SPA-ST).
An implementation that finds all the stable matchings in a given instance of the Student-Project Allocation problem with student preferences over projects and lecturer preferences over students.
Seeing something unexpected? Take a look at the
GitHub profile guide.