深度优先搜索DFS——图邻接矩阵表示

/*
图邻接矩阵表示DFS
input:
1
7
A 0 0 0 0 1 0 0
B 0 0 1 1 0 0 0
C 0 1 0 1 0 0 0
D 0 1 0 0 1 1 0
E 1 0 0 1 0 0 1
F 0 0 0 1 0 0 0
G 0 0 0 0 1 0 0
output:
A E D B C F G
*/
#include<iostream>
#include<cstring>
using namespace std;
struct Graph{
//图邻接矩阵表示
char data;
bool *adjacency;
};
void Create(Graph G[],int n){
//创建图邻接矩阵表示
int i,j;
for(i=1; i<=n; i++){
cin>>G[i].data;
G[i].adjacency = new bool
;
for(j=1; j<=n; j++)cin>>G[i].adjacency[j];
}
}
void DFS(Graph G[],int vex,int n,bool visited[]){
//DFS图邻接矩阵表示
if(!visited[vex]){
visited[vex] = true;
cout<<G[vex].data<<' ';
int i;
for(i=1; i<=n; i++){
if(G[vex].adjacency[i] && !visited[i])DFS(G,i,n,visited);
}
}
}
int main(){
Graph *G;
bool *visited;
int t,n;
cin>>t;
while(t--){
cin>>n;
G = new Graph
;
visited = new bool
;
memset(visited,0,sizeof(visited));
Create(G,n);
DFS(G,1,n,visited);
cout<<endl;
}
return 0;
}