图的深度优先搜索（非递归）

样例输入

4

0 1 0 1

1 0 0 0

0 0 0 1

1 0 1 0

样例输出

0 1 3 2

#include <stdio.h>
#include <memory.h>
#define COUNT 55
typedef struct {
    int arc[COUNT][COUNT];
    int verNum;
}Graph;
void create(Graph *G){
    scanf("%d",&G->verNum);
    for(int i = 0; i < G->verNum; i++)
        for(int j = 0; j < G->verNum; j++)
            scanf("%d",&G->arc[i][j]);
}
void DFS(Graph G){//从结点0开始访问
    int degree[COUNT];
    int hang,lie;
    int stack[COUNT],top = 0;
    int arc;
    stack[top++] = 0;
    memset(degree,1,COUNT * sizeof(int));
    while(top > 0){
        arc = stack[top - 1];
        if(degree[arc]){
            printf("%d ",arc);
            degree[arc] = 0;
        }
        for(lie = 0; lie < G.verNum; lie++){
            if(G.arc[arc][lie] && degree[lie]){
                stack[top++] = lie;
                break;
            }
        }
        if(lie == G.verNum)
            arc = stack[--top];
    }
}
int main(){
    Graph G;
    create(&G);
    DFS(G);
    printf("
");
    return 0;
}