diff options
Diffstat (limited to 'third_party/git/linear-assignment.h')
| -rw-r--r-- | third_party/git/linear-assignment.h | 22 |
1 files changed, 0 insertions, 22 deletions
diff --git a/third_party/git/linear-assignment.h b/third_party/git/linear-assignment.h deleted file mode 100644 index 1dfea766290d..000000000000 --- a/third_party/git/linear-assignment.h +++ /dev/null @@ -1,22 +0,0 @@ -#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 |