53 void      wbpcover(n_left, n_right, pointers, indices, vweight,  in wbpcover()  argument
57 int      *pointers;		/* start/stop of adjacency lists */
80 	n_left, n_right, pointers[n_left+n_right]-pointers[0]);
86 	for (j = pointers[i]; j < pointers[i + 1]; j++)  {
92 	for (j = pointers[i]; j < pointers[i + 1]; j++)  {
100     nedges = pointers[n_left + n_right] - pointers[0];
108     bpflow(n_left, n_right, pointers, indices, vweight, resid, flow, touched);
110     reachability(n_left, n_right, pointers, indices, resid, flow, touched);
154 confirm_cover(n_left, n_right, pointers, indices, flow, vweight, resid,
164 static void bpflow(n_left, n_right, pointers, indices, vweight, resid, flow, touched)  in bpflow()  argument
167 int      *pointers;		/* start/stop of adjacency lists */
189     for (i = pointers[n_left]; i < pointers[n_left + n_right]; i++) {
195 	for (j = pointers[i]; j < pointers[i + 1] && resid[i]; j++) {
214 	    modified = augment(i, pointers, indices, resid, flow, touched, seen);
222 static int augment(node, pointers, indices, resid, flow, touched, seen)  in augment()  argument
224 int      *pointers;		/* start/stop of adjacency lists */
239     touch(node, pointers, indices, resid, flow, touched, &flow1, seen, &nseen);
258 static void touch(node, pointers, indices, resid, flow, touched, flow1, seen, nseen)  in touch()  argument
260 int      *pointers;		/* start/stop of adjacency lists */
276     for (i = pointers[node]; i < pointers[node + 1]; i++) {
288 		for (k = pointers[neighbor];
289 			k < pointers[neighbor + 1] && indices[k] != node; k++);
295 		for (j = pointers[neighbor];
296 			j < pointers[neighbor + 1]; j++) {
299 			touch(indices[j], pointers, indices, resid, flow,
306 			    for (k = pointers[neighbor];
307 			    k < pointers[neighbor + 1] && indices[k] != node; k++);
322 static void reachability(n_left, n_right, pointers, indices, resid, flow, touched)  in reachability()  argument
325 int      *pointers;		/* start/stop of adjacency lists */
339 	    touch2(i, pointers, indices, flow, touched);
346 static int touch2(node, pointers, indices, flow, touched)  in touch2()  argument
348 int      *pointers;		/* start/stop of adjacency lists */
359     for (i = pointers[node]; i < pointers[node + 1]; i++) {
363 	    for (j = pointers[neighbor]; j < pointers[neighbor + 1]; j++) {
365 		    result = touch2(indices[j], pointers, indices, flow, touched);
378 void confirm_cover(n_left, n_right, pointers, indices, flow, vweight, resid,  in confirm_cover()  argument
382 int      *pointers;
411             for (j = pointers[i]; j < pointers[i + 1]; j++) {
420     i = count_flow(n_left, n_right, pointers, flow);
433     check_resid(n_left, n_right, vweight, resid, pointers, indices, flow);
438 int count_flow(n_left, n_right, pointers, flow)  in count_flow()  argument
441 int      *pointers;
447     for (i = pointers[n_left]; i < pointers[n_left + n_right]; i++) {
489 void check_resid(n_left, n_right, vweight, resid, pointers, indices, flow)  in check_resid()  argument
494 int      *pointers;
527         for (j = pointers[i]; j < pointers[i + 1]; j++) {