实现图的基本操作

要求：建立图(邻接矩阵、邻近表任选其一)的存储结构、实现图的深度优先遍历和广度优先遍历。

话不多说，代码贴上：

#include <stdio.h>

#include<iostream>

using namespace std;

#define MAX_Point 26           // 最大顶点数

int visited[MAX_Point];    // 遍历标志数组

struct Graph

{    

char vexs[MAX_Point];           // 顶点表    

int arc[MAX_Point][MAX_Point];      // 邻接矩阵    

int numVertexs, numEdges;            // 图中当前的顶点数和边数 };

void CreateGraph(Graph *graph)

{    

int i, j,k,io;

//printf("输入顶点数:");    

scanf("%d", &(graph->numVertexs));          // 接收输入的顶点数和边数,  

  // printf("输入顶点信息：");    

for(i = 0; i < graph->numVertexs; i++)                             // 读入顶点信息,建立顶点表  

   {

        getchar();                                                 // 清空键盘输入缓冲区        

       scanf("%c", &(graph->vexs[i]));    

   }

for(i = 0; i < graph->numVertexs; i++)    

{        

       for(j = 0; j < graph->numVertexs; j++)  

       {           

          graph->arc[i][j] = 0;                            // 邻接矩阵初始化       

       }    

}   

// printf("输入边数:");    

scanf("%d", &(graph->numEdges));

    //printf("输入边上的顶点，分别用空格分隔：");  

   for(k = 0; k < graph->numEdges; k++)                               // 读入numEdges条边，建立邻接矩阵  

   {

        getchar();                                                 // 清空键盘输入缓冲区        

       scanf("%d %d %d", &i, &j,&io);        

       graph->arc[i][j] =  io;        

       graph->arc[j][i] = graph->arc[i][j];                           // 因为是无向图，矩阵对称   

    }

}

void DFS(Graph graph, int i)

{    

   int j;    

   visited[i] = 1;                   // 标志已经被遍历过了    

   printf("%c ", graph.vexs[i]);

    for(j = 0; j < graph.numVertexs; j++)   

  {         // 如果与第i个顶点相邻接且该顶点还没有被遍历过，则对邻接顶点递归调用       

      if(graph.arc[i][j]!=0 && !visited[j])        

       {            

         DFS(graph, j);       

         }    

   }

}

void DFSTraverse(Graph graph)

{    

    cout<<"DFS:";   

    int i;    

   for(i = 0; i < graph.numVertexs; i++)  

   {         // 初始所有顶点都是未被遍历过的状态     

       visited[i] = 0;   

    }   

  for(i = 0; i < graph.numVertexs; i++)   

  {         // 对未访问过的顶点调用DFS，若是连通图，只会执行一次     

       if(!visited[i])      

       {           

          DFS(graph, i);  

       }    

   }   

  cout<<endl; }

//广度遍历

void BFS(Graph graph, int i)

{    

    int j;    

    visited[i] = 1;                   // 标志已经被遍历过了    

    printf("%c ", graph.vexs[i]);

    for(j = 0; j < graph.numVertexs; j++)

   {         // 如果与第i个顶点相邻接且该顶点还没有被遍历过，则对邻接顶点递归调用      

        if(graph.arc[i][j] !=0 && !visited[j])       

   {             //BFS(graph, j);            

        visited[j] = 1;                   // 标志已经被遍历过了          

         printf("%c ", graph.vexs[j]);

        }    

   }

}

void BFSTraverse(Graph graph)

{    

      cout<<"BFS:";    

      int i;    

      for(i = 0; i < graph.numVertexs; i++)    

     {         // 初始所有顶点都是未被遍历过的状态    

         visited[i] = 0;   

      }    

    for(i = 0; i < graph.numVertexs; i++)   

     {         // 对未访问过的顶点调用BFS，若是连通图，只会执行一次      

          if(!visited[i])        

          {            

            BFS(graph, i);      

           }    

     }    

      cout<<endl;

}

char change(int i)

{    

    char chng;  

    switch(i)    

   {    

   case 0:         chng='a';         break;    

   case 1:         chng='b';         break;    

   case 2:         chng='c';         break;    

   case 3:          chng='d';         break;    

   case 4:         chng='e';         break;    

   case 5:         chng='f';         break;    

   case 6:         chng='g';         break;    

   case 7:         chng='h';         break;    

   case 8:         chng='i';         break;    

   case 9:         chng='j';         break;    

   }   

  return chng;

}

void show(Graph graph) {  

   cout<<"edges are:"<<endl;  

   for(int i = 0; i < graph.numVertexs; i++)   

   {        

         for(int j = i+1; j < graph.numVertexs; j++)      

        {   

              if(graph.arc[i][j]!=0)

             {

                cout<<change(i)<<"-"<<change(j)<<":"<<graph.arc[i][j]<<endl;           

              }    

        }    

    }

}

 

int main()

{    

     Graph graph;    

    CreateGraph(&graph);  

    DFSTraverse(graph);    

    BFSTraverse(graph);    

    show(graph);    

    return 0;

}