The others are source code files written in C language. Solves maximum matching for undirected graphs presented in an adjacency-list format. If no filename is given, a small help message appears. It always writes to standard out. It was not written by the implementor.
Contributions are welcome.
The fields in each line type are as follows. Create a blossom. It was not written by the implementor. Contributions are welcome. If the first entry is 0, the i-th vertex is unmatched.