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

Hi Brian, On Wed, 30 May 2018, brian m. carlson wrote: > On Wed, May 30, 2018 at 09:14:06AM -0700, Stefan Beller wrote: > > 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.

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

On Wed, May 30, 2018 at 09:14:06AM -0700, Stefan Beller wrote: > 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

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

On Wed, May 30, 2018 at 6:55 AM, SZEDER Gábor 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

Re: [PATCH v2 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 > --- >

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

Hi Peff, On Sat, 5 May 2018, Jeff King wrote: > On Fri, May 04, 2018 at 05:34:29PM +0200, Johannes Schindelin 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

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

On Fri, May 04, 2018 at 05:34:29PM +0200, Johannes Schindelin 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 >

[PATCH v2 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