Unexpected output about hungarian-algorithm

[PascalEconomouCoupa]

I am also having the same problem. I tried to recreate it as simply as possible:

from hungarian_algorithm import algorithm

G = {
    0: {2: 4, 3: 6}, 
    1: {2: 5, 3: 7}
}

print(algorithm.find_matching(G, matching_type = 'max', return_type = 'list'))

Output:

[((1, 3), 7), ((0, 3), 6)]

On the other hand, it seems to work when I use the exact same graph structure, but I instead make the nodes str objects (though I cannot say for sure as I have not tested many examples):

H = {
    'a': {'c': 4, 'd': 6}, 
    'b': {'c': 5, 'd': 7}
}

print(algorithm.find_matching(H, matching_type = 'max', return_type = 'list'))

Output:

[(('a', 'c'), 4), (('b', 'd'), 7)]

[pukanc]

Alright, thank you :)

[PascalEconomouCoupa]

I should mention that that I still think this is an open issue. You would expect the algorithm to work with integer nodes, and it would be a bit inconvenient to need to convert to str. Plus, it is still not entirely clear if the same problems arise with str , as it hasn't been tested.