Diferente pentru algoritm-kuhn intre reviziile #11 si #12
Nu exista diferente intre titluri.
Diferente intre continut:
for (j = 1; j <= N; ++ j) scanf("%d", &G[i][j]);
memset (vr, 0, sizeof (vr)), memset (vc, 0, sizeof (vc));
memset (1, 0, sizeof (1)), memset (r, 0, sizeof (r));
memset (l, 0, sizeof (l)), memset (r, 0, sizeof (r));
for (cnt = 0; cnt < N; ++ cnt) {
memset (cr, 0, sizeof (cr)), memset (p, 0, sizeof (p));
memcpy (cc,1, sizeof (cc));
memcpy (cc, l, sizeof (cc));
find_zero ();
}
