Question

我正在尝试使用dfs实现拓扑排序（根据CLRS）。我确实显示了所需的输出，但程序仍然运行并导致分段错误。通过使用几个打印语句进行调试，我可以看出for循环永远不会退出，但它应该（当它== Edges.end（）时）。但是，请注意valgrind在

显示错误

dfsVisit(it->first);

在dfs（）内。我错过了什么？为什么迭代器不会递增而for循环退出？为什么在valgrind有不同的理由？

#include<cstdio>
#include<set>
#include<list>
#include<stack>
#include<algorithm>
#include<vector>
#include<utility>

struct node
{
    int d, f, value;
};

std::vector< std::pair<node, node> > Edges;
std::vector< std::pair<node, node> >::iterator it;
bool *visited;
int N, myTime=0;
node node1, node2;
void dfsVisit(node);

void dfs()
{
    for(it=Edges.begin(); it!=Edges.end(); it++)
        if(it->first.value<N)
            if(!visited[it->first.value])
                dfsVisit(it->first);
}

void dfsVisit(node n)
{
    myTime++;                           //increment myTime
    n.d=myTime;                         //set the discovery time for node n

    if(n.value<N)
        if(visited[n.value])
            return;

    for(it=Edges.begin(); it!=Edges.end(); ++it)
    {
        if(it->second.value>=N)
            continue;
        printf("In the for loop!\n");
        if(it->first.value==n.value && !visited[it->second.value])
        {
            printf("it->first.value: %d\n",it->first.value+1);
            printf("it->second.value: %d\n",it->second.value+1);
            dfsVisit(it->second);
            printf("Inside for and if\n");
        }

        printf("Inside for but outside if!\n");
        printf("Edges.end()-it: %d\n",Edges.end()-it);
    }

    visited[n.value]=true;
    myTime++;
    n.f=myTime;

    printf("For node %d, discovery time and finishing time is: %d, %d", n.value, n.d, n.f);
    return;
}

int main()
{
    int M, firstOfRule, secondOfRule, data, i;
    //node node1, node2;
    scanf("%d""%d",&N,&M);
    visited=new bool[N];

    for(i=0;i<N;i++)
        visited[i]=false;

    while(M--)
    {
        scanf("%d",&firstOfRule);
        scanf("%d",&secondOfRule);

        while(secondOfRule--)
        {
            scanf("%d",&data);
            node1.value=firstOfRule-1;
            node2.value=data-1;
            Edges.push_back(std::make_pair(node1,node2));
            printf("Pair: %d,%d\n", node1.value+1, node2.value+1);
        }
    }

    for(std::vector< std::pair<node, node> >::const_iterator it=Edges.begin(); it!=Edges.end(); ++it)
        printf("Connected %d and %d\n",it->first.value+1,it->second.value+1);

    dfs();

    return 0;
}

输出文件如下：

Pair: 1,2
Pair: 2,3
Connected 1 and 2
Connected 2 and 3
In the for loop!
it->first.value: 1
it->second.value: 2
In the for loop!
Inside for but outside if!
Edges.end()-it: 2
In the for loop!
it->first.value: 2
it->second.value: 3
In the for loop!
Inside for but outside if!
Edges.end()-it: 2
In the for loop!
Inside for but outside if!
Edges.end()-it: 1
For node 2, discovery time and finishing time is: 3, 4Inside for and if
Inside for but outside if!
Edges.end()-it: 0                         //----->  Why doesn't it exit here?
In the for loop!
Inside for but outside if!
Edges.end()-it: -1
In the for loop!
Inside for but outside if!
Edges.end()-it: -2
In the for loop!
Inside for but outside if!
Edges.end()-it: -3
... and so on until the program crashes!

感谢您的帮助！

Answer 1

您已将std::vector< std::pair<node, node> >::iterator it;声明为全局变量。

但是你在递归函数dfsVisit中使用它。这意味着当对dfsVisit的嵌套调用结束时，它会离开it == Edges.end()。但是之前的dfsVisit继续执行它的循环，执行++it会导致未定义的行为。

要解决此问题，请将it设为dfsVisit函数的局部变量。

注意：如果你的编译器支持C ++ 11，你可以避免一些输入并使用auto来声明迭代器。

矢量迭代器没有递增

1 个答案: