C ++：将元素从unordered_set复制到向量

Question

背景：我正在为旅行商问题实现最近邻算法。 我需要计算巡回旅行的距离以及跟踪所访问点的顺序。 我已经定义了一个带有实例变量x和y的点类，以及一个用于计算两点之间距离的函数calcDist 。 我首先将所有点存储在std::unordered_set命名points ，创建一个空的std::vector命名path来存储游览路径，并将起点指定给startPoint ，并将它们传递给nearestNeighbor()函数：

void nearestNeighbor(unordered_set<Point, PointHasher> points, vector<Point> &path, Point startPoint) {
  // Declare variables
  unordered_set<Point, PointHasher>::iterator it;
  Point currentLocation, possibleNeighbor, nearestNeighbor;
  double totalDist = 0;
  int pointsCount = path.capacity() - 1;

  // Set the starting location
  it = points.find(startPoint);
  currentLocation = *it;
  path[0] = currentLocation;
  points.erase(currentLocation);
  cout << "Start location: " << path[0].x << ", " << path[0].y << endl;

  // Create the path
  for (int i = 1; points.size() > 0; i++) {
    double minDist = -1;
    // Find the current location's nearest neighbor
    for (it = points.begin(); it != points.end(); it++) {
      possibleNeighbor = *it;
      int currentDist = currentLocation.calcDist(possibleNeighbor);
      if (minDist == -1 || currentDist < minDist) {
        minDist = currentDist;
        nearestNeighbor = possibleNeighbor;
      }
    }
    // Record nearest neighbor data and prepare for the next iteration
    currentLocation = nearestNeighbor;
    path[i] = currentLocation;
    points.erase(currentLocation);
    totalDist += minDist;
    cout << "Nearest neighbor: " << path[i].x << ", " << path[i].y << endl;
  }
  // Return to the starting location
  path[pointsCount] = startPoint;
  cout << "End location: " << startPoint.x << ", " << startPoint.y << endl;
  cout << "Path:" << endl;
  for (int i = 0; i < path.size(); i++) {
    cout << path[0].x << ", " << path[0].y << endl;
  }
  cout << "Total distance: " << totalDist << endl;
}

问题是，一旦程序退出外部for循环， path中的所有点都会以某种方式被覆盖。 看看我的意思，这是输出：

Start location: 3, 4
Nearest neighbor: 6, 8
Nearest neighbor: 11, 7
Nearest neighbor: 50, 8
End location: 3, 4
Path:
3, 4
3, 4
3, 4
3, 4
3, 4
Total distance: 49
Press any key to continue . . .

我认为这要么是向量元素的指针/地址的问题，要么是具有范围的东西，因为问题发生在退出for循环之后。 我甚至尝试在每次迭代后打印path[1]以查看它何时被更改，但它在整个循环中是正确的，并且只在结尾处输出更改。 有什么想法吗？ 我很难过。 如果你已经做到这一点，非常感谢你的时间。

Answer 1

你总是输出path [0] man的坐标

for (int i = 0; i < path.size(); i++) {
    cout << path[0].x << ", " << path[0].y << endl;
}

Answer 2

你有

for (int i = 0; i < path.size(); i++) {
    cout << path[0].x << ", " << path[0].y << endl;
  }

这不会迭代i 。 将您的0更改为i ，您可能会看到更有帮助的内容：

for (int i = 0; i < path.size(); i++) {
    cout << path[i].x << ", " << path[i].y << endl;
}

编辑：更改path[i] = currentLocation; to path.push_back(currentLocation); - 这将自动增加path向量的大小以适应新元素。

void nearestNeighbor(
    unordered_set<Point, PointHasher> points,
    vector<Point> &path,
    Point startPoint,
    double &totalDist) // note the new variable passed here
{
  // Declare variables
  unordered_set<Point, PointHasher>::iterator it;
  Point currentLocation, possibleNeighbor, nearestNeighbor;
  // double totalDist = 0; Remove this line
  // int pointsCount = path.capacity() - 1; And this

  // Set the starting location
  it = points.find(startPoint);
  currentLocation = *it;
  path.push_back(currentLocation); // Changed this line
  points.erase(currentLocation);
  cout << "Start location: " << path[0].x << ", " << path[0].y << endl;

  // Create the path
  for (int i = 1; points.size() > 0; i++) {
    double minDist = -1;
    // Find the current location's nearest neighbor
    for (it = points.begin(); it != points.end(); it++) {
      possibleNeighbor = *it;
      int currentDist = currentLocation.calcDist(possibleNeighbor);
      if (minDist == -1 || currentDist < minDist) {
        minDist = currentDist;
        nearestNeighbor = possibleNeighbor;
      }
    }
    // Record nearest neighbor data and prepare for the next iteration
    currentLocation = nearestNeighbor;
    path.push_back(currentLocation); // And this line
    points.erase(currentLocation);
    totalDist += minDist;
    cout << "Nearest neighbor: " << path[i].x << ", " << path[i].y << endl;
  }
  // Return to the starting location
  path.push_back(startPoint); // And here also!
  cout << "End location: " << startPoint.x << ", " << startPoint.y << endl; // This I didn't change, 
// but perhaps you should make it reflect the last point in the vector, 
// not the start point which is supposed to be the last point in the vector
  cout << "Path:" << endl;
  for (int i = 0; i < path.size(); i++) {
    cout << path[i].x << ", " << path[i].y << endl;
  }
  cout << "Total distance: " << totalDist << endl;
}

Answer 3

我没有看到任何增加path向量大小的地方。

我怀疑你为第二个参数传递一个空的std :: vector，并且只要你点击path[0]=currentLocation; ......未定义的行为

另外，我认为capacity（）没有你认为的那样做。

那，正如其他人所指出的那样，你没有正确输出数组的内容，但这是一个小问题。 这里的主要问题是这个程序可能会乱写并破坏堆。