c_cpp 迭代DFS

Posted 2021-05-14

//https://www.geeksforgeeks.org/iterative-depth-first-traversal/
#include <iostream>
using namespace std;

int main() {
    int n,m,x,y;
    cin>>n>>m;

    int g[n][n]= {0};
    for (int i=0;i<m;i++) {
        cin>> x>>y;
        g[x][y]=1;
    }
    bool visited[n]= {0};
    int dfs[n], stk[n], top=0;
    stk[top]= 0;
    x= 1;
    y=0;
    while (x++<=n) {
        int s= stk[top--];
        visited[s]= 1;
        dfs[y++]= s;
        for (int j=m-1; j>=0; j--){
            if (visited[j]==0 && g[s][j]==1) {
                stk[++top]=j;
            }
        }
    }
    for (int i=0; i<n; i++)
        cout<< dfs[i]<< " ";
}