5-1 基于邻接矩阵表示的深度优先遍历

程序填空题
5-1 基于邻接矩阵表示的深度优先遍历

#include <stdio.h>
#define MVNum 100                           
typedef struct{ 
    char vexs[MVNum];          
    int arcs[MVNum][MVNum];   
    int vexnum,arcnum;      
}AMGraph;
int visited[MVNum];
void CreateUDN(AMGraph &G);//实现细节隐藏

void DFS(AMGraph G, int v){  
    printf("%c ",G.vexs[v]);  visited[v] =1;  
    int w;
    for(w = 0; w < G.vexnum; w++)
       if(G.arcs[v][w]&&!visited[w])
       DFS(G,w);
))  
        DFS(G, w);
}

void DFSTraverse(AMGraph G){ 
    int v;
    for(v = 0; v < G.vexnum; ++v)  
        visited[v] = 0;
    for(v = 0; v < G.vexnum; ++v) 
        if(!visited[v])
             DFS(G,v);
}

int main(){
    AMGraph G;     
    CreateUDN(G);
    DFSTraverse(G);
    return 0;
}