交通咨询模拟系统实验报告

一、问题描述全国交通咨询模拟：处于对不同目的的旅客对交通工具有不同的要求。

例如， 因公出差的旅客希望在旅途中的时间尽可能短，出门旅游的游客则希望旅费尽可能省，而老年旅客则要求中转次数最少。

编制一个全国城市间的交通咨询程序，为旅客提供两种或三种最优决策的交通咨询。

1、根据题目中的基本要求分析，流程设计框图如下：255班次2、逻辑结构拆分：3、 1 2、）添加城市3、）查找城市并返回序号4、）删除城市5、）添加列车6、）添加航班7、）删除列车或航班8、）找出最小费用路线9、）初始化系统数据（读入内存）10、）找出最快路线11、）计算最快路线耗费的时间并打印12、）计算最小费用路线13、）主界面14、）存储信息到文件15、）退出、2、下面是各模块示意图：基本操作：函数变量声明：#include <stdio.h>#include <string.h>#define ERR 0#define OK 1#define Dij_MAXN 33#define MAX_VERTEX_NUM 31#define MAX_STRING_NUM 10{} TrafficNodeDat;typedef struct VNode{CityType city;int TrainNum,FlightNum; //标记下面Train数组和Flight数组里元素个数TrafficNodeDat Train[MAX_TRAFFIC_NUM]; //数组成员为结构体，记录了到达城市、起止时间、票价和班次TrafficNodeDat Flight[MAX_TRAFFIC_NUM]; // int Cost; //遍历时到达该城市的耗费（时间或者费用）} VNodeDat;typedef struct PNode{函数构成：int main(){char name[MAX_STRING_NUM];char s_city[MAX_STRING_NUM];char e_city[MAX_STRING_NUM];int Command,cost;int startcity,endcity,traveltype;int s_hour,s_minute,e_hour,e_minute;while (1){ShowMenu(); //显示菜单printf("System Info Save OK!\n");break;case 2: //删除城市InitSysData();printf("\n输入城市名:");scanf("%s",&name);DelCity(name);SaveSysInfo();printf("System Info Save OK!\n");break;case 3: //添加路线InitSysData();scanf("%2d:%2d",&e_hour,&e_minute);printf("票价:");scanf("%d",&cost);if (traveltype){InsertFlight(name,s_city,e_city,s_hour*60+s_minute,e_hour*60+e_minute,cost);else{InsertTrain(name,s_city,e_city,s_hour*60+s_minute,e_hour*60+e_minute,cost);}case 5: //最小耗费InitSysData();printf("\n起始城市:");scanf("%s",&name);startcity=SeekCity(name);if (startcity<0)printf("Error City Name:No such city!\n");break;}printf("终点城市:");scanf("%s",&name);break;}CalcMinCost(startcity,endcity,traveltype);printf("\n");break;case 6: //最短时间路线InitSysData();printf("\n起始城市:");scanf("%s",&name);startcity=SeekCity(name);if (startcity<0){printf("类型(列车0,航班1) :");scanf("%d",&traveltype);if (traveltype!=0&&traveltype!=1) {printf("Error Input!");break;}CalcMinTime(startcity,endcity,traveltype);printf("\n");break;}}查询最}（2）查找城市并返回城市序号：int SeekCity (char *name){int i;for (i=0;i<CityNum;i++)if (strcmp(name,CityName[i])==0){return i;}}}fclose(fp);total=0;fp=fopen(TrainFile,"w");for (i=0;i<CityNum;i++){total+=AdjList[i].TrainNum;fprintf(fp,"%d\n",total);for (i=0;i<CityNum;i++){for (j=0;j<AdjList[i].TrainNum;j++) {fp=fopen(FlightFile,"w");for (i=0;i<CityNum;i++){total+=AdjList[i].FlightNum;}fprintf(fp,"%d\n",total);for (i=0;i<CityNum;i++){for (j=0;j<AdjList[i].FlightNum;j++){fprintf(fp,"%s %s %s ", AdjList[i].Flight[j].name,CityName[i],int InsertCity (char *Name){strcpy(CityName[CityNum],Name);AdjList[CityNum].city=CityNum;AdjList[CityNum].FlightNum=0;AdjList[CityNum].TrainNum=0;CityNum++;return 1;}（5）删除城市：int DelCity (char *Name){strcpy(AdjList[i].Flight[j].name,AdjList[i+1].Flight[j].name);AdjList[i].Flight[j].StartTime=AdjList[i+1].Flight[j].StartTime;AdjList[i].Flight[j].StopTime=AdjList[i+1].Flight[j].StopTime;}}CityNum--;return 1;}（6）添加火车路线：int InsertTrain (char *train,char *StartCity,char *EndCity,int StartTime,int EndTime,int cost) {int i,j;int InsertFlight(char *flight,char *StartCity,char *EndCity,int StartTime,int EndTime,int cost) {int i,j;i=SeekCity(StartCity);j=SeekCity(EndCity);AdjList[i].Flight[AdjList[i].FlightNum].Cost=cost;AdjList[i].Flight[AdjList[i].FlightNum].EndCity=j;AdjList[i].Flight[AdjList[i].FlightNum].StartTime=StartTime; AdjList[i].Flight[AdjList[i].FlightNum].StopTime=EndTime; strcpy(AdjList[i].Flight[AdjList[i].FlightNum].name,flight); AdjList[i].FlightNum++;return 1;break;}if (flag){for (;j<AdjList[i].FlightNum-1;j++){AdjList[i].Flight[j].Cost=AdjList[i].Flight[j+1].Cost;AdjList[i].Flight[j].EndCity=AdjList[i].Flight[j+1].EndCity;strcpy(AdjList[i].Flight[j].name,AdjList[i].Flight[j+1].name);AdjList[i].Flight[j].StartTime=AdjList[i].Flight[j+1].StartTime;AdjList[i].Flight[j].StopTime=AdjList[i].Flight[j+1].StopTime; }{AdjList[i].Train[j].Cost=AdjList[i].Train[j+1].Cost;AdjList[i].Train[j].EndCity=AdjList[i].Train[j+1].EndCity;strcpy(AdjList[i].Train[j].name,AdjList[i].Train[j+1].name);AdjList[i].Train[j].StartTime=AdjList[i].Train[j+1].StartTime;AdjList[i].Train[j].StopTime=AdjList[i].Train[j+1].StopTime;}AdjList[i].TrainNum--;break;}}return 1;出发的{cost+=matx[PreCity[j]][j];track[i++]=j=PreCity[j];}printf("\nTrack Way:");if (!TravelType){for(i--;i>0;i--){printf("\n%s:",CityName[track[i]]);end=track[i-1];min=32767;for (k=0;k<AdjList[track[i]].TrainNum;k++)if( !(startH/10) ){printf("0");}printf("%d:",startH);if( !(startM/10) ){printf("0");}printf("%d -- ",startM);if( !(endH/10) ){);}}else{for(i--;i>0;i--){printf("\n%s:",CityName[track[i]]);end=track[i-1];min=32767;for (k=0;k<AdjList[track[i]].FlightNum;k++)//这句错了，AdjList[track[i]].Train[k].EndCity改为AdjList[track[i]].Flight[k].EndCity！startM = AdjList[track[i]].Flight[tmp].StartTime % 60;endH = AdjList[track[i]].Flight[tmp].StopTime / 60 ;endM = AdjList[track[i]].Flight[tmp].StopTime % 60 ;if( !(startH/10) ){printf("0");}printf("%d:",startH);if( !(startM/10) ){printf("0");}//printf("%2d:%2d-%2d:%2d",AdjList[track[i]].Flight[tmp].StartTime / 60,AdjList[track[i]].Flight[tmp].StartTime % 60,AdjList[track[i]].Flight[tmp].StopTime / 60,AdjList[track[i]].Flight[tmp].StopTime % 60);}}printf("\n%s: DESTINATION!",CityName[track[0]]);printf("\nMin Cost : %d\n",cost);}（10）找出最小费用路线void Dijkstra(int matx[Dij_MAXN][Dij_MAXN],int p_start,int p_end,int TravelType) {for (i=0;i<CityNum;i++)if (PreCity[i]!=-1){for (j=0;j<CityNum;j++)if(PreCity[j]==-1&&matx[i][j]>0&&(min<0||matx[i][j]<min)){pre=i;pos=j;min=matx[i][j];}}PreCity[pos]=pre;}{printf("\nError:Cannot Open City File...\n");return -1;}fscanf(fp,"%d",&CityNum);for (i=0;i<CityNum;i++){fscanf(fp,"%s",&CityName[i]);AdjList[i].city=i;AdjList[i].TrainNum=0;AdjList[i].FlightNum=0;}fscanf(fp,"%s",&stmp2);fscanf(fp,"%s",&stmp3);j=SeekCity(stmp2);AdjList[j].Train[AdjList[j].TrainNum].EndCity=SeekCity(stmp3);strcpy(AdjList[j].Train[AdjList[j].TrainNum].name,stmp1);fscanf(fp,"%d:%d",&hour,&minute);AdjList[j].Train[AdjList[j].TrainNum].StartTime=hour*60+minute; fscanf(fp,"%d:%d",&hour,&minute);AdjList[j].Train[AdjList[j].TrainNum].StopTime=hour*60+minute; fscanf(fp,"%d",&cost);AdjList[j].Train[AdjList[j].TrainNum].Cost=cost;AdjList[j].TrainNum++;fscanf(fp,"%s",&stmp1);fscanf(fp,"%s",&stmp2);fscanf(fp,"%s",&stmp3);j=SeekCity(stmp2);AdjList[j].Flight[AdjList[j].FlightNum].EndCity=SeekCity(stmp3); strcpy(AdjList[j].Flight[AdjList[j].FlightNum].name,stmp1);fscanf(fp,"%d:%d",&hour,&minute);AdjList[j].Flight[AdjList[j].FlightNum].StartTime=hour*60+minute;fscanf(fp,"%d:%d",&hour,&minute);AdjList[j].Flight[AdjList[j].FlightNum].StopTime=hour*60+minute;fscanf(fp,"%d",&cost);AdjList[j].Flight[AdjList[j].FlightNum].Cost=cost;if (MinTime>CurTime-StartTime){for (i=0;i<=curPathNo;i++){MinPath[i].City=Path[i].City;MinPath[i].TraNo=Path[i].TraNo;curPath=curPathNo;}MinTime=CurTime-StartTime;}}elsePath[curPathNo].TraNo=i;SearchMinTime(AdjList[City].Train[i].EndCity,EndCity,AdjList[City].Train[i].StopTime+(CurTime/ 1440)*1440,curPathNo,TravelType);}if((AdjList[City].Train[i].StartTime<(CurTime%1440))&&(AdjList[City].Train[i].StopTime+(CurTime /1440)*1440-StartTime<MinTime)){Path[curPathNo].TraNo=i;SearchMinTime(AdjList[City].Train[i].EndCity,EndCity,AdjList[City].Train[i].StopTime+(CurTime/{Path[curPathNo].TraNo=i;SearchMinTime(AdjList[City].Flight[i].EndCity,EndCity,AdjList[City].Flight[i].StopTime+(CurTime/ 1440)*1440,curPathNo,TravelType);}if((AdjList[City].Flight[i].StartTime<CurTime)&&(AdjList[City].Flight[i].StopTime+(CurTime/1440)* 1440-StartTime<MinTime)){Path[curPathNo].TraNo=i;int i;int startH, startM, endH, endM;//定义四个变量:startH 出发的小时，startM 出发的分钟，endH 到达的小时，endM 到达的分钟MinTime=32767;curPath=0;Path[0].City=StartCity;if (!TravelType){for (i=0;i<AdjList[StartCity].TrainNum;i++){Path[0].TraNo=i;StartTime=AdjList[StartCity].Train[i].StartTime;SearchMinTime(AdjList[StartCity].Flight[i].EndCity,EndCity,AdjList[StartCity].Flight[i].StopTime,0, TravelType);}}if (MinTime==32767){printf("\nNo access to that destination!");return 0;}// if (!TravelType)// StartTime=AdjList[StartCity].Train[MinPath[0].TraNo].StartTime;// else%s%sstartM = AdjList[MinPath[i].City].Train[MinPath[i].TraNo].StartTime % 60 ;endH = AdjList[MinPath[i].City].Train[MinPath[i].TraNo].StopTime / 60 ;endM = AdjList[MinPath[i].City].Train[MinPath[i].TraNo].StopTime % 60 ;if( !(startH/10) ){printf("0");}printf("%d:",startH);if( !(startM/10) ){printf("0");}//printf(" %2S:%2S-%2S:%2S\n",startH);}printf("%s: DESTINATION!",CityName[EndCity]);printf("\nTime Cost: %2d hour - %2d minute",MinTime/60,MinTime%60);return 1;}（14）计算最小费用路线：int CalcMinCost (int StartCity,int EndCity,int TravelType){int ma[Dij_MAXN][Dij_MAXN];int i,j,min,end;for (i=0;i<CityNum;i++)while (end==AdjList[i].Train[j].EndCity&&j<AdjList[i].TrainNum){if (AdjList[i].Train[j].Cost<min){min=AdjList[i].Train[j].Cost;}j++;}ma[i][end]=min;}}}if (AdjList[i].Flight[j].Cost<min){min=AdjList[i].Flight[j].Cost;}j++;}ma[i][end]=min;}}}Dijkstra(ma,StartCity,EndCity,TravelType); return 1;2、添加城市：输入命令1后，按提示输入城市名，而后返回主界面原city文件：添加城市后的city文件：3、删除城市：输入命令2后，按提示输入城市名，而后返回主界面4、添加路线：输入命令3后，按提示依次输入起始站、终点站、类型、起始时刻、到达时刻、票价等信息，而后返回主界面添加路线后的train文件：5、删除路线：输入命令4后，按提示输入，而后返回主界面删除路线后的train文件：6、查找最小费用花费：输入命令5后，按提示输入起始城市、终点城市、类型，而后返回主界面结果正确！7、查找最小时间花费：输入命令6后，按提示输入城市名，而后返回主界面结果正确！8、退出：输入命令0后，退出系统七、课程设计小结：1、实验过程中的注意点1）遇到逻辑问题，然后设断点，调试跟踪看哪步出了问题.比如说全局变量和局部变量设置出现问题，导致运行过程各变量的取值不对。