学步园

#include<stdio.h><br /> #include<stdlib.h><br /> #define VV 100<br /> #define EE 999<br /> #include<iostream><br /> using namespace std;<br /> bool visited[100];<br /> int q[100];<br /> struct graph{<br /> int v,e;<br /> char vex[VV];<br /> int edge[EE][EE];<br /> };<br /> //构造图<br /> void createGraph(graph * g){<br /> int i=0,j=0;<br /> printf("type the number of vertex:/n");<br /> scanf("%d",&g->v);<br /> printf("type the number of edge:/n");<br /> scanf("%d",&g->e);<br /> printf("type the vertex:/n");<br /> cout<<"gg"<<g->v<<endl;<br /> for(i=0;i<g->v;i++){cin>>g->vex[i];}<br /> printf("type the edge:/n");<br /> for(i=0;i<g->v;i++){<br /> for(j=0;j<g->v;j++){cin>>g->edge[i][j];}<br /> }<br /> }<br /> //深度搜索<br /> void dfs(graph * g,int v){<br /> int i;<br /> cout<<g->vex[v]<<endl;<br /> visited[v]=1;<br /> for(i=0;i<g->v;i++){<br /> if(visited[i]!=1&&g->edge[v][i]!=0) dfs(g,i);<br /> }<br /> }<br /> //广度搜索<br /> void bfs(graph * g, int v){<br /> int i;<br /> int front,rear;<br /> front=rear=-1;<br /> cout<<g->vex[v]<<endl;<br /> visited[v]=1;<br /> q[++rear]=v;<br /> while(front!=rear){<br /> v=q[++front];<br /> for(i=0;i<g->v;i++){<br /> if(visited[i]!=1&&g->edge[v][i]!=0){<br /> cout<<g->vex[i]<<endl;<br /> visited[i]=1;<br /> q[++rear]=i;<br /> }<br /> }<br /> }<br /> }<br /> int main()<br /> {<br /> graph * g;<br /> g=(graph *)malloc(sizeof(graph));<br /> createGraph(g);<br /> dfs(g,0);<br /> memset(visited,0,sizeof(visited));<br /> bfs(g,0);<br /> return 0;<br /> }<br />