138                                  int min_i, int min_j,
715     int i, j, min_i = 0, min_j = 0;  in icvIsOptimal()  local
733                     min_j = j;  in icvIsOptimal()
740     enter_x->j = min_j;  in icvIsOptimal()
910     int i, j, min_i = -1, min_j = -1;  in icvRussel()  local
988                     min_j = j;  in icvRussel()
1002         icvAddBasicVariable( state, min_i, min_j, prev_u_min_i, prev_v_min_j, &u_head );  in icvRussel()
1039                 if( cur_u->val == cost[i][min_j] )      /* row i needs updating */  in icvRussel()
1075                      int min_i, int min_j,  in icvAddBasicVariable()  argument
1081     if( state->s[min_i] < state->d[min_j] + state->weight * CV_EMD_EPS )  in icvAddBasicVariable()
1085         state->d[min_j] -= temp;  in icvAddBasicVariable()
1089         temp = state->d[min_j];  in icvAddBasicVariable()
1090         state->d[min_j] = 0;  in icvAddBasicVariable()
1095     state->is_x[min_i][min_j] = 1;  in icvAddBasicVariable()
1099     end_x->j = min_j;  in icvAddBasicVariable()
1101     end_x->next[1] = state->cols_x[min_j];  in icvAddBasicVariable()
1103     state->cols_x[min_j] = end_x;  in icvAddBasicVariable()