广度优先 BFS
广度优先类似于树的的层次遍历,核心用到 队列的思想
深度优先 DFS
void DFSTraval(Graph *g,int v){
visited[v]=1;
cout<<v+1<<endl;
for(int i=0;i<g->vexnum;i++){
if(g->arcs[v][i]==1&&visited[i]==0){
DFSTraval(g,i); //深度优先
}
}
}
void DFS(Graph *g){ //深度优先遍历
for(int i=0;i<g->vexnum;i++){
visited[i]=0;
}
for(int i=0;i<g->vexnum;i++){ //访问所有结点,如果有多个连通分量
if(visited[i]==0){
DFSTraval(g,i); //从当前节点开始进行深度优先遍历
}
}
}
深度优先类似于树的先根遍历 , 核心用到递归的思想
#include <iostream>
#define Maxvex 100
#include <queue>
bool visited[Maxvex];//在深度优先中是否被遍历过
typedef char VertexType;//顶点类型
typedef int EdgeType;
using namespace std;
queue<int> Q;
typedef struct {
VertexType vexs[Maxvex];//存放顶点的数组
EdgeType arc[Maxvex][Maxvex];//存放边的二维数组
int numVertexs,numEdges;//存放当前顶点数和边的个数
}AdjacencyMarix;
void CreatAMatrix(AdjacencyMarix *AM){
cout<<"输入顶点的个数和边数"<<endl;
cin>>AM->numVertexs>>AM->numEdges;
cout<<"====================================\n";
cout<<"输入各个顶点:"<<endl;
//初始化顶点矩阵
for(int i=0;i<AM->numVertexs;i++)
{
char v;
cout<<"顶点 :"<<i+1;
cin>>v;
AM->vexs[i]=v;
}
//初始化邻接矩阵
for(int i=0;i<AM->numVertexs;i++){
for(int j=0;i<AM->numVertexs;i++){
AM->arc[i][j]=0;
}
}
cout<<"=======================================\n";
for(int i=0;i<AM->numEdges;i++){
int m,n;
cout<<"输入边(vi,vj)的值:\n";
cin>>m>>n;
AM->arc[m-1][n-1]=1;
AM->arc[n-1][m-1]=1;
}
}
void DisplayAMatrix(AdjacencyMarix *AM){
//打印矩阵信息
for(int i=0;i<AM->numVertexs;i++)
for(int j=0;j<AM->numVertexs;j++){
if(j<AM->numVertexs-1)
cout<<AM->arc[i][j];
else{
cout<<AM->arc[i][j]<<endl;
}
}
}
void BFS(AdjacencyMarix *AM,int i){
visited[i]=true;
cout<<AM->vexs[i];
Q.push(i);
while(!Q.empty()){
i=Q.front();
Q.pop();
for(int j=0;j<AM->numVertexs;j++){
if(!visited[j]&&AM->arc[i][j]!=0)
{
visited[j]=true;
cout<<AM->vexs[j];
Q.push(j);
}
}
}
}
void BFSTraverse(AdjacencyMarix *AM){
for(int i=0;i<AM->numVertexs;i++){
visited[i]=false;
}
for(int i=0;i<AM->numVertexs;i++){//遍历图 ,非连通的图
if(!visited[i]){
BFS(AM,i);
}
}
}
void DFS(AdjacencyMarix *AM,int i){
cout<<AM->vexs[i];
visited[i]=true;
for(int j=0;j<AM->numVertexs;j++){
if(!visited[j]&&AM->arc[i][j]!=0){
DFS(AM,j);
}
}
}
void DFSTraverse(AdjacencyMarix *AM){
for(int i=0;i<AM.numVertexs;i++){ //初始化经广度优先后已遍历的数组
visited[i]=false;
}
for(int i=0;i<AM->numEdges;i++){
if(!visited[i])
DFS(AM,i);
}
}
int main(){
AdjacencyMarix AM;
CreatAMatrix(&AM);
DisplayAMatrix(&AM);
BFSTraverse(&AM);
cout<<endl;
DFSTraverse(&AM);
return 0;
}