I am working on the following problem-
"Finding the matching among all possible matching such that the sum of edge weight is minimum in the matching."
Please note that I like to search over all possible matching (that includes maximum matching and other matchings as well). As per my knowledge, Hungarian algorithm searches over all possible maximum matching (and not among all matching). Please let me know if I can use the Hungarian algorithm to solve this problem.