帮我看看代码运行时该输啥#include<stdio.h>#define N 3#define M 5typedef struct{ char data[N]; int location[N][N];}graph;void Creatgraph(graph *g) //建立无向图{ int i,j,k; int w; for(i=0;i<N;i++) g->data[i]=getchar(); for(i=0;i<N;i++) for(j=0;j<N;j++) g->location[i][j]=0; for(k=0;k<M;k++) { scanf("%d%d%f",&i,&j,&w); g->location[i][j]=w; g->location[j][i]=w; }}int visited[N]={0};void DFS(graph *g,int i) //深度优先遍历无向图{ int j; printf("node:%c\n",g->data[i]); visited[i]=1; for(j=0;j<N;j++) if((g->location[i][j]==1)&&(!visited[j])) DFS(g,j);}void BFS(graph *g,int i)//广度优先遍历{ int j; printf("%d ",g->data[i]); visited[i]=1; for(j=0;j<N;j++) { if(g->location[i][j]!=0 && visited[j]!=1) BFS(g,j); }}int main(){ graph g; Creatgraph(&g); DFS(&g,3); BFS(&g,3); printf("\n"); return 0;}