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

}while(chose2!=0); break;

case 3:

do {

cout<<"*欢迎进入路径修改界面!*\n"; cin>>chose3; switch(chose3)

{

case 1: cout<<"请输入插入路径的起点"; cin>>insert1; cout<<"请输入插入路径的终点";

cin>>insert2;

cout<<"请输入插入路径的路长"; cin>>insert3;

change(insert1,insert2,insert3,GA); cout<<"插入成功!\n"<<endl; break;

case 2: cout<<"请输入修改路径的起点";

cin>>insert1;

cout<<"请输入修改路径的终点"; cin>>insert2;

cout<<"请输入修改路径的路长"; cin>>insert3;

change(insert1,insert2,insert3,GA); cout<<"修改成功!\n"<<endl;

break; case 3: cout<<"请输入删除路径的起点"; cin>>insert1; cout<<"请输入删除路径的终点";

cin>>insert2;

change(insert1,insert2,100000,GA); cout<<"删除成功!\n"<<endl; break; break;

case 0:

default: cout<<"您的输入有误，即将返回路径修改界面"<<endl;

break;