Re: [PATCH 01/18] Add a function to solve least-cost assignment problems

Hi Duy, On Sun, 13 May 2018, Duy Nguyen wrote: > On Thu, May 3, 2018 at 5:30 PM, Johannes Schindelin > wrote: > > + /* reduction transfer */ > > + free_row = xmalloc(sizeof(int) * row_count); > > + for (int i = 0; i < row_count; i++) { > > travis

Re: [PATCH 01/18] Add a function to solve least-cost assignment problems

On Thu, May 3, 2018 at 5:30 PM, Johannes Schindelin wrote: > + /* reduction transfer */ > + free_row = xmalloc(sizeof(int) * row_count); > + for (int i = 0; i < row_count; i++) { travis complains about this hungarian.c: In function

[PATCH 01/18] Add a function to solve least-cost assignment problems

The Jonker-Volgenant algorithm was implemented to answer questions such as: given two different versions of a topic branch (or iterations of a patch series), what is the best pairing of commits/patches between the different versions? Signed-off-by: Johannes Schindelin