Please use the issue tracker only to report bugs (i.e. errors in the library that need to be fixed) or feature requests.

For questions about how to compile, install or use the library, please use instead the mailing list at https://graph-tool.skewed.de/mailing
(If unsure, use the mailing list first.)

When opening new issues, please choose the BUG template from the drop-down menu, and fill out the required information.

Maximum cardinality matching for weighted graphs

Please implement a version for weighted graphs that finds the optimum result, not just a fast heuristic version.

I'm currently using igraph and R, but your library is definitely faster in all aspects. I'm currently working with hundred thousandth edges bipartite graphs, but it will probably scale up in the near future.

Thanks. Pedro