linear-assignment: a function to solve least-cost assignment problems
commit22d87333e5ee8871a9d42a15834ad91168a95928
authorJohannes Schindelin <johannes.schindelin@gmx.de>
Mon, 13 Aug 2018 11:33:00 +0000 (13 04:33 -0700)
committerJunio C Hamano <gitster@pobox.com>
Mon, 13 Aug 2018 17:44:50 +0000 (13 10:44 -0700)
treef5a3502d94a981851b4e35b00bf84826555e7b4b
parent1d89318c48d233d52f1db230cf622935ac3c69fa
linear-assignment: a function to solve least-cost assignment problems

The problem solved by the code introduced in this commit goes like this:
given two sets of items, and a cost matrix which says how much it
"costs" to assign any given item of the first set to any given item of
the second, assign all items (except when the sets have different size)
in the cheapest way.

We use the Jonker-Volgenant algorithm to solve the assignment problem 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@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
Makefile
linear-assignment.c [new file with mode: 0644]
linear-assignment.h [new file with mode: 0644]