- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
int edge(int x, int* peak){
int min = -1;
for (int i = 0; i < N; i++){
if (min == -1 && this->arr[x][i] != 0 && peak[i] != 1) min = i;
else if (this->arr[x][min] > this->arr[x][i] && this->arr[x][i] != 0 && peak[i] != 1)
min = i;
}
return min;
};
Комментарии (0) RSS
Добавить комментарий