while(cur_neighbor != cur_v) {
  cur_table.push_back(cur_neighbor);
  int next_neighbor = -1;
  for (int j = 1; j <= n; ++j) {
    if (f[cur_neighbor][j] != 0 && j != prev_neighbor) {
      next_neighbor = j;
    }
  }
  prev_neighbor = cur_neighbor;
  cur_neighbor = next_neighbor;
}