数据结构——图的邻接矩阵的深度优先搜索

  
    

   
     
   
     #include 
   
     <
   
     iostream
   
     >
   
     

   
     using
   
      
   
     namespace
   
      std;
 

   
     #define
   
      MAX_VERTEX_NUM 10 
   
     //
   
     最大顶点个数
   
     
typedef 
   
     char
   
      VERTYPE;
typedef 
   
     struct
   
     
{
 VERTYPE vexs[MAX_VERTEX_NUM]; 
   
     //
   
     顶点向量
   
     

   
      
   
     int
   
      visited[MAX_VERTEX_NUM]; 
   
     //
   
     访问标志数组
   
     

   
      
   
     int
   
      arcs[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; 
   
     //
   
     邻接矩阵
   
     

   
      
   
     int
   
      vexnum,arcnum; 
   
     //
   
     图的当前顶点数和弧数
   
     

   
     }mgraph, 
   
     *
   
      MGraph;



   
     void
   
      init_mgraph(MGraph 
   
     &
   
     g) 
   
     //
   
     初始化图
   
     

   
     {
 g
   
     =
   
     (MGraph)malloc(
   
     sizeof
   
     (mgraph));
 g
   
     ->
   
     vexnum
   
     =
   
     0
   
     ;
 g
   
     ->
   
     arcnum
   
     =
   
     0
   
     ;
 
   
     for
   
     (
   
     int
   
      i
   
     =
   
     0
   
     ;i
   
     <
   
     MAX_VERTEX_NUM;i
   
     ++
   
     )
 g
   
     ->
   
     vexs[i]
   
     =
   
     0
   
     ;
 
   
     for
   
     (i
   
     =
   
     0
   
     ;i
   
     <
   
     MAX_VERTEX_NUM;i
   
     ++
   
     )
 g
   
     ->
   
     visited[i]
   
     =
   
     0
   
     ; 
   
     //
   
     访问标志数组置0，表示没有被访问
   
     

   
      
   
     for
   
     (i
   
     =
   
     0
   
     ;i
   
     <
   
     MAX_VERTEX_NUM;i
   
     ++
   
     )
 
   
     for
   
     (
   
     int
   
      j
   
     =
   
     0
   
     ;j
   
     <
   
     MAX_VERTEX_NUM;j
   
     ++
   
     )
 g
   
     ->
   
     arcs[i][j]
   
     =
   
     0
   
     ;
}


   
     void
   
      add_vexs(MGraph 
   
     &
   
     g) 
   
     //
   
     增加顶点
   
     

   
     {
 cout
   
     <<
   
     "
   
     请输入顶点的个数:
   
     "
   
     <<
   
     endl;
 cin
   
     >>
   
     g
   
     ->
   
     vexnum;
 cout
   
     <<
   
     "
   
     请输入顶点的值
   
     "
   
     <<
   
     endl;
 
   
     for
   
     (
   
     int
   
      i
   
     =
   
     0
   
     ;i
   
     <
   
     g
   
     ->
   
     vexnum;i
   
     ++
   
     )
 {
 cin
   
     >>
   
     g
   
     ->
   
     vexs[i];
 }
}

   
     void
   
      add_arcs(MGraph 
   
     &
   
     g) 
   
     //
   
     增加边
   
     

   
     {
 cout
   
     <<
   
     "
   
     请输入边的个数:
   
     "
   
     <<
   
     endl;
 cin
   
     >>
   
     g
   
     ->
   
     arcnum;
 VERTYPE ch1,ch2;
 
   
     int
   
      row,col;

 
   
     for
   
     (
   
     int
   
      i
   
     =
   
     0
   
     ;i
   
     <
   
     g
   
     ->
   
     arcnum;i
   
     ++
   
     )
 { 
 cin
   
     >>
   
     ch1
   
     >>
   
     ch2;
 
   
     for
   
     (
   
     int
   
      j
   
     =
   
     0
   
     ;j
   
     <
   
     g
   
     ->
   
     vexnum;j
   
     ++
   
     )
 {
 
   
     if
   
     (g
   
     ->
   
     vexs[j]
   
     ==
   
     ch1)
 {
 row
   
     =
   
     j;
 }
 
   
     if
   
     (g
   
     ->
   
     vexs[j]
   
     ==
   
     ch2)
 {
 col
   
     =
   
     j;
 }
 }
 g
   
     ->
   
     arcs[row][col]
   
     =
   
     1
   
     ; 
 g
   
     ->
   
     arcs[col][row]
   
     =
   
     1
   
     ; 
   
     //
   
     无向图加上此行
   
     

   
      }
}


   
     void
   
      creat_mgraph(MGraph 
   
     &
   
     g) 
   
     //
   
     创建图 
   
     

   
     {
 add_vexs(g); 
   
     //
   
     增加顶点
   
     

   
      add_arcs(g); 
   
     //
   
     增加边
   
     

   
     }


   
     void
   
      print_mgraph(MGraph 
   
     &
   
     g) 
   
     //
   
     打印图
   
     

   
     {
 
   
     for
   
     (
   
     int
   
      i
   
     =
   
     0
   
     ;i
   
     <
   
     g
   
     ->
   
     vexnum;i
   
     ++
   
     )
 cout
   
     <<
   
     "
   
      
   
     "
   
     <<
   
     g
   
     ->
   
     vexs[i];
 cout
   
     <<
   
     endl;
 
   
     for
   
     (i
   
     =
   
     0
   
     ;i
   
     <
   
     g
   
     ->
   
     vexnum;i
   
     ++
   
     )
 {
 cout
   
     <<
   
     g
   
     ->
   
     vexs[i]
   
     <<
   
     "
   
      
   
     "
   
     ;
 
   
     for
   
     (
   
     int
   
      j
   
     =
   
     0
   
     ;j
   
     <
   
     g
   
     ->
   
     vexnum;j
   
     ++
   
     )
 {
 cout
   
     <<
   
     g
   
     ->
   
     arcs[i][j]
   
     <<
   
     "
   
      
   
     "
   
     ;
 }
 cout
   
     <<
   
     endl;
 }
}


   
     void
   
      Visit(MGraph 
   
     &
   
     g,
   
     int
   
      i)
{
 cout
   
     <<
   
     g
   
     ->
   
     vexs[i]
   
     <<
   
     "
   
      
   
     "
   
     ;
 g
   
     ->
   
     visited[i]
   
     =
   
     1
   
     ;
}

   
     //
   
     深度优先搜索
   
     

   
     void
   
      DFSTraverse(MGraph 
   
     &
   
     g,
   
     int
   
      i) 
   
     //
   
     从第i个顶点开始搜索
   
     

   
     {
 Visit(g,i);
 
   
     for
   
     (
   
     int
   
      j
   
     =
   
     0
   
     ;j
   
     <
   
     g
   
     ->
   
     vexnum;j
   
     ++
   
     )
 
   
     if
   
     (g
   
     ->
   
     arcs[i][j] 
   
     &&
   
      
   
     !
   
     g
   
     ->
   
     visited[j])
 DFSTraverse(g,j);
}


   
     int
   
      main()
{
 MGraph G;
 init_mgraph(G); 
   
     //
   
     初始化图
   
     

   
      creat_mgraph(G); 
   
     //
   
     创建图
   
     

   
      print_mgraph(G); 
   
     //
   
     打印图
   
     

   
      DFSTraverse(G,
   
     0
   
     ); 
   
     //
   
     深度优先搜索
   
     

   
     
 
   
     return
   
      
   
     0
   
     ;
}