Question

我实际上是在尝试实施弗洛伊德的warshall算法，但我遇到了一个难点。当我试图在我的序列矩阵中找到最短路时，我遇到了分段错误。我按照本教程： floyd's warshall algorithm

一切都运作良好，除了第124行：

chemin.insert(it,sequenceTest[v1-1][temp-1]);

我得到了段错（你可以跳过第一部分，除非你想知道我如何实现算法，但问题是在第二部分）：

#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int main()
{
int i,j,k;
int sequenceTest [4][4] = {{1,2,3,4},{1,2,3,4},{1,2,3,4},{1,2,3,4}};
int tempSequenceTest [4][4];
int distanceTest [4][4] = {{0,2,4,100000},{2,0,1,5},{4,1,0,3},{100000,5,3,0}};
int tempDistanceTest[4][4];

for(i=0;i<4;i++)
{
    for(j=0;j<4;j++)
    {
        cout<<sequenceTest[i][j]<<" ";
    }
    cout<< endl;
}

cout<< endl;

for(i=0;i<4;i++)
{
    for(j=0;j<4;j++)
    {
        cout << distanceTest[i][j] << " ";
    }
    cout<< endl;
}

cout<< endl;

for(k=0;k<3;k++)
{
    cout <<endl;
    for(i=0;i<4;i++)
    {
        for(j=0;j<4;j++)
        {
            cout << "i: " << i << " j: " << j << endl;
            if(i == k)
            {
                tempSequenceTest[i][j] = sequenceTest[i][j];
                tempDistanceTest[i][j] = distanceTest[i][j];
                cout << " D " << tempDistanceTest[i][j] << " S " << tempSequenceTest[i][j];
            }
            if(j == k)
            {
                tempSequenceTest[i][j] = sequenceTest[i][j];
                tempDistanceTest[i][j] = distanceTest[i][j];
                cout << " D " << tempDistanceTest[i][j] << " S " << tempSequenceTest[i][j];
            }
            cout<< endl;
        }
    }

    for(i=0;i<4;i++)
        {
            for(j=0;j<4;j++)
            {
                //cout<< "i: " << i << " j: " << j << " k:" << k << endl;
                if(i!=k && j!=k)
                {
                    if(distanceTest[i][j]> distanceTest[i][k] + distanceTest[k][j])
                    {
                        tempDistanceTest[i][j] = distanceTest[i][k] + distanceTest[k][j];
                        cout << distanceTest[i][j] << " > " << distanceTest[i][k] << " + " << distanceTest[k][j] << " = " <<  tempDistanceTest[i][j] << " " << i << j << endl;
                        tempSequenceTest[i][j] = k+1;
                    }
                    else
                    {
                        tempDistanceTest[i][j] = distanceTest[i][j];
                        tempSequenceTest[i][j] = sequenceTest[i][j];
                    }
                }
            }
        }
        cout<< endl;
        for(i=0;i<4;i++)
        {
            for(j=0;j<4;j++)
            {
                distanceTest[i][j] = tempDistanceTest[i][j];
                sequenceTest[i][j] = tempSequenceTest[i][j];
            }
        }
        for(i=0;i<4;i++)
        {
            for(j=0;j<4;j++)
            {
                cout<<tempSequenceTest[i][j]<<" ";
            }
            cout<< endl;
        }

        cout<< endl;

        for(i=0;i<4;i++)
        {
            for(j=0;j<4;j++)
            {
                cout << tempDistanceTest[i][j] << " ";
            }
            cout<< endl;
        }
}

int v1, v2;
v1 = 1;
v2 = 4;
vector <int> chemin;
vector <int>::iterator it;
chemin.push_back(v1);
chemin.push_back(v2);
int temp = v2;
cout << sequenceTest[0][2];
while(sequenceTest[v1-1][temp-1] != v2)
{
    it = chemin.begin() + 1;
    cout << "V1: " << v1 << " V2: " << v2 << " Temp: " << temp << endl;
    chemin.insert(it,sequenceTest[v1-1][temp-1]);
    for(i=0;i<chemin.size();i++)
    {
        cout << chemin[i];
    }
    cout << endl;
    temp = sequenceTest[v1-1][temp-1];
}
}

感谢您的关注并花时间帮助我！

Answer 1

chemin.insert(it,sequenceTest[v1-1][temp-1]);

这使迭代器it无效，但您在后续的迭代中不断重用它。如果要继续插入相同位置，请捕获返回值。

it = chemin.insert(it,sequenceTest[v1-1][temp-1]);

矢量插入分段故障第二次迭代

1 个答案: