AugmentingPaths

SageMath code for finding maximum-sized matchings in bipartite graphs.

The easiest way to execute the code in this repository is to copy and paste it into the server at https://sagecell.sagemath.org/