Vincent Goudard

https://en.wikipedia.org/wiki/Hungarian_algorithm

) in jitter. Basically, a NxN matrix as input would return a size N vector with the colums indices for each row that minimize the cost (as expressed in the input matrix).

The steps to the algorithm are described 

, but the iteration process makes it inconvenient with usual objects.  However, I don't really like the idea of externals, and would prefer a vanilla Max solution.

What do you think would be the best way to implement that?

jit.gen ?  javascript ? node.script ? else ?

Hi,

I want to use the Hungarian algorithm (https://en.wikipedia.org/wiki/Hungarian_algorithm) in jitter. Basically, a NxN matrix as input...

hungarian-algorithm-on-jitmatrix

That would be the start with standard objects:

And a quick shot at finding the columns with two zeros:

I got roughly to the same point with dimop and stumbled on the 

https://stackoverflow.com/questions/10074270/how-can-i-find-the-minimum-number-of-lines-needed-to-cover-all-the-zeros-in-a-2

That's when I started considering jit.gen (or anything to get through) !

Thanks for your patch though: I learnt about the handy "-1" step in jit.dimop (how handy, compared to using jit.matrixinfo to  get the dim!) and you reminded me about the equally handy @in2_name. :)

I ended up using javascript and it was pretty much straight forward using a ready-made library like this one : 

It is a bit CPU-greedy and I'll need to see if this can be optimized somehow, but it does the job for now!

Hungarian algorithm on jit.matrix