i++){ if((i != source) && (i != sink)) { list[p] = i; p++;
height[source] = NODES; excess[source] = INFINITE; for (i = 0; i < NODES; i++) push(C, F, excess, source, i);
p = 0; while (p < NODES - 2) { int u = list[p]; int old_height = height[u]; discharge(C, F, excess, height, seen, u); if (height[u] > old_height) { moveToFront(p,list); p=0;
else p += 1;
int maxflow = 0; for (i = 0; i < NODES; i++) maxflow += F[source][i];
free(list);
free(seen); free(height); free(excess);
return maxflow; }
void printMatrix(const int * const * M) { int i,j; for (i = 0; i < NODES; i++) { for (j = 0; j < NODES; j++) printf("%d\t",M[i][j]); printf("\n");
int main(void) { int **flow, **capacities, i; flow = (int **) calloc(NODES, sizeof(int*)); capacities = (int **) calloc(NODES, sizeof(int*)); for (i = 0; i < NODES; i++) { flow[i] = (int *) calloc(NODES, sizeof(int)); capacities[i] = (int *) calloc(NODES, sizeof(int));
//Sample graph