@nikitsaraf I am sure that this is a good test. However I'm not sure that this is the answers we should want. Let me try to explain.

When we are passing a sub_graph to the hungarian algorithm, we are asking for the lowest cost assignment of records in A to records in B. However, this does not allow the possibility that some record in A really does not match any of the records in B. So, for example we get 1 and 6 to match, whereas as if there was a possibility that 1 didn't match any records in B, the more likely 4 and 6 would match. Thoughts?
It seems