void matrix_make(Graph &g){ //由邻接表构造邻接矩阵
Arcnode *p = new Arcnode;
memset(g.arc_matrix,0,sizeof(g.arc_matrix));
for(int i = 1;i <= g.vex_sum;i++)
{
p = g.vexlist[i].firstarc;
while(p){
g.arc_matrix[i][p->adjvex] = 1;
p = p->nextarc;
}
}
for(int i = 1;i <= g.vex_sum;i++)
for(int j = 1;j <= g.vex_sum;j++)
if(g.arc_matrix[i][j] == 1)g.arc_matrix[j][i] = 1;
}
void dfs(Graph &g,int v){
visit[v] = 1;
cout<<g.vexlist[v].data<<endl;
for(int i = 1;i <= g.vex_sum;i++)
{
if(g.arc_matrix[i][v] == 1 && visit[i] == 0)dfs(g,i);
}
}
void dfs_travel(Graph &g){
for(int i = 1;i <= g.vex_sum;i++)visit[i] = 0;
for(int i = 1;i <= g.vex_sum;i++)//对于连通图没有实际意义对于非连通图有查漏作用
if(!visit[i])dfs(g,i);
}完整代码：
#include<cstdio>
#include<iostream>
#include<malloc.h>
#include<cstring>
#define max_sum 30
using namespace std;
typedef struct Arcnode{
int adjvex;
struct Arcnode *nextarc;
}Arcnode;
typedef struct Vexnode{
char data;
struct Arcnode *firstarc;
}Vnode,AdjList[max_sum];
typedef struct Graph{
AdjList vexlist;
int vex_sum;
int arc_sum;
int arc_matrix[max_sum][max_sum];
}Graph;
int visit[max_sum];
void creat_graph(Graph &g){
cout<<"输入顶点和边的个数："<<endl;
cin>>g.vex_sum>>g.arc_sum;
for(int i = 1;i <= g.vex_sum;i++)
{
cout<<"输入字符："<<endl;
cin>>g.vexlist[i].data;
g.vexlist[i].firstarc = NULL;
}
for(int i = 1;i <= g.arc_sum;i++)
{
cout<<"输入起点和终点："<<endl;
int s,e;
cin>>s>>e;
Arcnode *p = new Arcnode;
p->adjvex = e;
p->nextarc = g.vexlist[s].firstarc;
g.vexlist[s].firstarc = p;
}
}
void print_graph(Graph &g){
for(int i = 1;i <= g.vex_sum;i++){
Arcnode *head = new Arcnode;
head = g.vexlist[i].firstarc;
if(g.vexlist[i].firstarc != NULL)cout<<g.vexlist[i].data<<" :";
else cout<<endl;
while(g.vexlist[i].firstarc){
cout<<(g.vexlist[i].firstarc)->adjvex<<" ";
g.vexlist[i].firstarc = (g.vexlist[i].firstarc)->nextarc;
}cout<<endl;
g.vexlist[i].firstarc = head;
}
}
void reverse(Graph &g,Graph &r){ //逆邻接表
r.vex_sum = g.vex_sum;
r.arc_sum = g.arc_sum;
for(int i = 1;i <= r.vex_sum;i++){
r.vexlist[i].data = g.vexlist[i].data;
r.vexlist[i].firstarc = NULL;
}
for(int i = 1;i <= r.vex_sum;i++)
{
while(g.vexlist[i].firstarc){
int sym = (g.vexlist[i].firstarc)->adjvex;
Arcnode *p = new Arcnode;
p->adjvex = i;
p->nextarc = r.vexlist[sym].firstarc;
r.vexlist[sym].firstarc = p;
g.vexlist[i].firstarc = (g.vexlist[i].firstarc)->nextarc;
}
}
}
void matrix_make(Graph &g){ //由邻接表构造邻接矩阵
Arcnode *p = new Arcnode;
memset(g.arc_matrix,0,sizeof(g.arc_matrix));
for(int i = 1;i <= g.vex_sum;i++)
{
p = g.vexlist[i].firstarc;
while(p){
g.arc_matrix[i][p->adjvex] = 1;
p = p->nextarc;
}
}
for(int i = 1;i <= g.vex_sum;i++)
for(int j = 1;j <= g.vex_sum;j++)
if(g.arc_matrix[i][j] == 1)g.arc_matrix[j][i] = 1;
}
void dfs(Graph &g,int v){
visit[v] = 1;
cout<<g.vexlist[v].data<<endl;
for(int i = 1;i <= g.vex_sum;i++)
{
if(g.arc_matrix[i][v] == 1 && visit[i] == 0)dfs(g,i);
}
}
void dfs_travel(Graph &g){
for(int i = 1;i <= g.vex_sum;i++)visit[i] = 0;
for(int i = 1;i <= g.vex_sum;i++)
if(!visit[i])dfs(g,i);
}
int main()
{
Graph g,r;
creat_graph(g);
matrix_make(g);
dfs_travel(g);
}