Hungarian algorithm: Difference between revisions

Revision as of 04:58, 14 May 2023

Revision as of 05:23, 14 May 2023

Line 198:

}

// delta will always be non-negative,

// except possibly during the first iteration if onetime ofthis C[j_cur][*]loop isruns

// if any entries of C are negative

for (int w = 0; w <= W; ++w) {

if (in_Z[w]) ys[job[w]] += delta, yt[w] -= delta;

Line 262:

}

</syntaxhighlight>

==Connection to successive shortest paths==