最短距离问题数据结构课程设计报告(5)

cout<<"*---------------欢迎使用北海公园路径查询程序-----------------*\n"; cout<<"*------------------------------------------------------------*"<<endl; cin>>chose1; switch(chose1) {

case 1:

PrintMatrix(GA,VT);//根据邻接矩阵输出二元组表示 break;

do {

cout<<"*欢迎进行最短路径选择界面!请输入您从哪个门进入!*\n"; cout<<"------------------------------------------------\n"<<endl;

cin>>chose2; switch(chose2)

{

case 1: cout<<"您选择的起点为东门"<<endl;

start=2;

Dijkstra(GA,dist,path,start,9); Print(path,start,VT); break; case 2: cout<<"您选择的起点为前门"<<endl;

start=0;

Dijkstra(GA,dist,path,start,9); Print(path,start,VT); break;

case 2:

case 3: cout<<"您选择的起点为后门"<<endl;

start=5;

Dijkstra(GA,dist,path,start,9); Print(path,start,VT); break;

case 0: system("cls");//清屏语句 cout<<"退出成功，返回主菜单!\n"<<endl;

break;

default: system("cls");//清屏语句 cout<<"您的输入有误，返回最短路径界面重新输入!"<<endl;

break;