This website was built to help Stanford students find pset groups for their classes.

Built with the help of a Next JS boilerplate and MIT's psetpartners.

The matchings are created using Edmonds' blossom algorithm, where each edge weight is 1 / (1 + d) where d is the weighted euclidian distance between two responses.