Revision df93e407f0618e4a8265ac619dc7f4c7005155bc authored by Johannes Schindelin on 29 March 2024, 10:45:01 UTC, committed by Johannes Schindelin on 17 April 2024, 20:30:10 UTC
We will need to call this function from `hook.c` to be able to prevent hooks from running that were written as part of a `clone` but did not originate from the template directory. Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
1 parent 48c171d
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
Computing file changes ...
