Skip to main content

Browse the archive

https://github.com/git/git
31 May 2024, 23:06:24 UTC
Revision b86a4be245d0ba077c97c6ab6b1cdbeb9dcc1342 authored by Jonathan Nieder on 19 April 2020, 23:30:34 UTC, committed by Jonathan Nieder on 19 April 2020, 23:30:34 UTC 
Git 2.24.3
 
This merges up the security fix from v2.17.5.

Signed-off-by: Jonathan Nieder <jrnieder@gmail.com>
2 parent s 506223f + f2771ef
Raw File
Tip revision: b86a4be245d0ba077c97c6ab6b1cdbeb9dcc1342 authored by Jonathan Nieder on 19 April 2020, 23:30:34 UTC
Git 2.24.3
Tip revision: b86a4be
linear-assignment.h 
#ifndef LINEAR_ASSIGNMENT_H
#define LINEAR_ASSIGNMENT_H

/*
 * Compute an assignment of columns -> rows (and vice versa) such that every
 * column is assigned to at most one row (and vice versa) minimizing the
 * overall cost.
 *
 * The parameter `cost` is the cost matrix: the cost to assign column j to row
 * i is `cost[j + column_count * i].
 *
 * The arrays column2row and row2column will be populated with the respective
 * assignments (-1 for unassigned, which can happen only if column_count !=
 * row_count).
 */
void compute_assignment(int column_count, int row_count, int *cost,
			int *column2row, int *row2column);

/* The maximal cost in the cost matrix (to prevent integer overflows). */
#define COST_MAX (1<<16)

#endif
back to top