Is there a standard way to get maximum (or minimum) weight perfect matching in igraph? I think the standard approach for that is the Blossom algorithm. I do not think I see it listed in the documentation, but wanted to double check here in case you have more insight.
There is a PR that is long overdue for review. New feature: maximum matching of general graph by elena-schafer · Pull Request #2550 · igraph/igraph · GitHub