This repository contains C++ and Koka code for computing a maximum cardinality matching for a graph given in DIMACS format using Edmonds algorithm. The C++ graph class is due to Stefan Hougardy.
This repository contains C++ and Koka code for computing a maximum cardinality matching for a graph given in DIMACS format using Edmonds algorithm. The C++ graph class is due to Stefan Hougardy.