On Wed, May 30, 2018 at 6:55 AM, SZEDER Gábor <szeder.dev@xxxxxxxxx> wrote: >> 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 <johannes.schindelin@xxxxxx> >> --- >> Makefile | 1 + >> hungarian.c | 205 ++++++++++++++++++++++++++++++++++++++++++++++++++++ >> hungarian.h | 19 +++++ > > (Nit: I personally don't really like these filenames, I know they will > surprise and distract me every time I notice them for years to come... :) Good point. I remember my initial reaction to the file names was expecting some hungarian notation, which totally didn't make sense, so I refrained from commenting. Searching the web for the algorithm, maybe 'lapjv.c' is adequate? (short for "Linear Assignment Problem Jonker Volgenant") Matlab has a function named lapjv solving the same problem, so it would fall in line with the outside world. Out of interest, why is it called hungarian in the first place? (I presume that comes from some background of DScho in image processing or such, so the the answer will be interesting for sure:)
