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