main.cpp

数据结构课程设计用C++实现图的遍历等！

#include<iostream.h>
#include"Queue.h"
#include"Queue.cpp"
#include"Graph.h"
#include"Graph.cpp"        //引用图文件
int main()
{
 cout<<"     1、图邻接表的建立(C)             \n";
 cout<<"     2、深度优先遍历(D)               \n";
 cout<<"     3、广度优先遍历(B)               \n";
 cout<<"     4、最小生成树(prim)(P)           \n";
 cout<<"     5、退出(E)                       \n";
 cout<<"请选择操作:";
 Graph G;
 int i=0;
 char ch;
 while(1){           //重复操作
  cin>>ch;        //选择操作      
  switch(ch)
  { 
  case 'C':         //建图
  case 'c': 
   G.CreateGraph(); 
   break;
  case 'D':       //深度优先遍历
  case 'd':
   cout<<"深度优先遍历:\n";
   cout<<"请输入深度优先遍历的起始点:";
   cin>>i;
   G.Graph_traverse(ch,i);
   break;
  case 'B':               //广度优先遍历
  case 'b':
   cout<<"广度优先遍历:\n";
   cout<<"请输入广度优先遍历的起始点:";
   cin>>i;
   G.Graph_traverse(ch,i);
   break;
  case 'P':             //最小生成树
  case 'p':
   cout<<"请输入最小生成树的起始点:";
   cin>>i;
   G.Prim(i); 
   break;
  case 'E':               //退出
  case 'e':
   cout<<"*************************\n";
   cout<<"*****感谢使用本系统!*****\n";
   cout<<"*************************\n";
   return 0;
  }
  cout<<"   ************************************************************\n";
  cout<<"   **深度优先遍历(D)//广度优先遍历(B)//最小生成树(P)//退出(E)**\n";
  cout<<"   ************************************************************\n";
  cout<<"请选择操作:";
 }
}