C++实现图的邻接矩阵存储和广度、深度优先遍历实例分析

#include <stdio.h>
#define MAX_GRAPH 100
#define MAX_QUEUE 30
typedef struct
{
 char vex[MAX_GRAPH];  
 int edge[MAX_GRAPH][MAX_GRAPH]; 
 int n; 
 int e; 
}GRAPH;
void Create(GRAPH *G); 
void BFS(GRAPH *G,int k);  
void DFS(GRAPH *G,int k); 
int visited[MAX_GRAPH];
int main(int argc, char *argv[])
{
 int i;
 for(i = 0 ; i < MAX_QUEUE ; ++i)
  visited[i] = 0;
 GRAPH G;
 Create(&G);

 DFS(&G,0);
  
 return 0;
}
void BFS(GRAPH *G,int k)
{
 int queue[MAX_QUEUE]; 
 int front = -1,rear = -1,amount = 0;
 int visited[MAX_GRAPH]; 
 int i,j;
 
 for(i = 0 ; i < MAX_GRAPH ; ++i)
  visited[i] = 0;
  
 printf("访问顶点%c\n",G->vex[k]);
 visited[k] = 1;
 
 rear = (rear + 1) % MAX_QUEUE; 
 queue[rear] = k;
 front = rear;
 ++amount;
 
 while(amount > 0)
 {
  i = queue[front]; 
  front = (front + 1) % MAX_QUEUE;
  --amount;
  
  for(j = 0 ; j < G->n ; ++j)
  {
   if(G->edge[i][j] != 0 && visited[j] == 0)
   {
    printf("访问顶点%c\n",G->vex[j]);
    visited[j] = 1;
    
    rear = (rear + 1) % MAX_QUEUE; 
    queue[rear] = j;
    ++amount;
   }
  }
 }
 printf("遍历结束\n"); 
}
void DFS(GRAPH *G,int k)
{
 int j;
 printf("访问顶点：%c\n",G->vex[k]);
 visited[k] = 1;
 
 for(j = 0 ; j < G->n ; ++j)
 {
  if(G->edge[k][j] != 0 && visited[j] == 0)
   DFS(G,j);
 }
}
void Create(GRAPH *G)
{
 printf("输入顶点数：\n");
 scanf("%d",&G->n);
 printf("输入边数：\n");
 scanf("%d",&G->e);
 
 getcha();
 
 int i,j,k,w;
 printf("请输入端点(char型)：\n");
 for(i = 0 ; i < G->n ; ++i) 
  scanf("%c",&G->vex[i]);
  
 for(i = 0 ; i < G->n ; ++i) 
  for(j = 0 ; j < G->n ; ++j)
   G->edge[i][j] = 0;
 
 printf("请输入边：\n"); 
 for(k = 0 ; k < G->e ; ++k)
 {
  scanf("%d%d%d",&i,&j,&w); 
  G->edge[i][j] = w;
  G->edge[j][i] = w;
 }
}