We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b86d74b commit e7679e7Copy full SHA for e7679e7
src/main/java/com/thealgorithms/graph/HungarianAlgorithm.java
@@ -73,7 +73,9 @@ public static Result solve(int[][] cost) {
73
Arrays.fill(used, false);
74
do {
75
used[j0] = true;
76
- int i0 = p[j0], delta = Integer.MAX_VALUE, j1 = 0;
+ int i0 = p[j0];
77
+ int delta = Integer.MAX_VALUE;
78
+ int j1 = 0;
79
for (int j = 1; j <= n; j++) {
80
if (!used[j]) {
81
int cur = a[i0 - 1][j - 1] - u[i0] - v[j];
0 commit comments