数据结构课程设计交通咨询系统设计

1、设计题目 :交通咨询系统设计P160一、设计要求1 .问题描述根据不同目的的旅客对交通工具有不同的要求。例如，因公出差的旅客 希望在旅途中的时间尽可能的短，出门旅行的旅客希望旅费尽可能的少， 而老年 人则要求中转次数少。模拟一个全国城市之间的咨询交通程序，为旅客提供两种 或三种最优的交通路线。2.需求分析二、概要设计1. 主界面设计jPpT m GTgw jA|萄刖入你的选择;一一 一一戋一一一 一一-一足一一一 is 一路一 -帀帀疇小曙 鑛蛋苔算一 trW-Ttr-箭.t?b.町丄（图“交通咨询系统”主菜单）2. 存储结构设计本系统采用图结构类型存储抽象交通咨询系统的信息。typedef

2、struct TrafficNode无向网操作模块min = AdjListtracki.Traink.Cost; tmp = k;printf(%s, AdjListtracki.T); printf(%2d:%2d-%2d:%2d,AdjListtracki.Traintmp.StartTime / 60, AdjListtracki.Traintmp.StartTime % 60,AdjListtracki.Traintmp.StopTime / 60, AdjListtracki.Traintmp.StopTime % 60);elsefor (i-; i0;

3、i-) printf(n%s:, CityNametracki); end = tracki - 1; min = 32767;for (k = 0; kAdjListtracki.Flightk.Cost)min = AdjListtracki.Flightk.Cost; tmp = k;printf(%s, AdjListtracki.F); printf(%2d:%2d-%2d:%2d,AdjListtracki.Flighttmp.StartTime / 60, AdjListtracki.Flighttmp.StartTime % 60,AdjListtra

4、cki.FIighttmp.StopTime / 60,AdjListtracki.FIighttmp.StopTime % 60);printf(n%s: DESTINATION!, CityNametrack0);prin tf(nMin Cost : %dn, cost); void Dijkstra(int matxDij_MAXNDij_MAXN, int p_start, int p_end, intTravelType)int PreCityDij_MAXN;添加城市在主菜单下，用户输入 1添加城市名称!( Q _P| 0 0 C fl _P M憑HKXIIIIXUJOIIKX

5、；”输人你的选择江 林人城市名：即G9tem InfqOKI（图添加城市）2 删除城市在主菜单下，用户输入2,删除已添加城市名称唐输入你的选詮漿麵鑑，请重新输入！ System Info Save OK?（图删除城市）3.添加交通路线在主菜单下，用户输入3,已添加城市名称。添加起始城市、终点城市名称、乘 车类型、乘车班次、起始时刻、终点时刻、和票价。Fran一一驚一X*ocri_ncn_no的选擇注市容土 DJ市名；FH屯，0 人刊芜壮机斑枚;旋 日寸i cum ：ea. 話朝50 = 00：-4F6_、日-掃 TGIU-HC2h UtSI =00 = 0924丿（图添加交通路线）4 删除交通

6、路线输入班次号，删除交通路线（图删除交通路线）5查询最小费用交通路线:青输入你的选择汚軌越市=蔭点HH类型疋列车血航班丄、询Tt*ack Lla.y!BB：T55 0： 9- 9: 8HH： DESTINATION*Min Cost = S&7（图查询最小费用交通路线）6.查询最快交通路线（图查询最快交通路线）7 清除屏幕8.退出六、用户手册使用本系统时，用户需先向程序添加城市后，在已有城市基础上添加已有城市的 路线和使用各项功能。七、调试报告程序运行无错误，但当系统输入其他无储存内容时程序会意外中断，代码需要优化。八、程序清单#i nclude #in elude #in elude #in

7、 elude #defi ne ERR 0#defi ne OK 1#defi ne Dij_MAXN 100#defi ne MAX_VERTEX_NUM 100#defi ne MAX_STRING_NUM 100#defi ne MAX_TRAFFIC_NUM 100const char CityFile = ; const char TrainFile = ; const char FlightFile = typedef short int CityType;rainNum;fprintf(fp, %dn, total); rainNum; j+) , CityN

8、amei, CityNameAdjListi.Trainj.EndCity);fprintf(fp, %2d:%2d %2d:%2d %dn,AdjListi.Trainj.StartTime / 60, rainj.StartTime % 60, AdjListi.Trainj.StopTime / 60, AdjListi.Trainj.StopTime % 60, AdjListi.Trainj.Cost);fclose(fp); total = 0;fp = fopen(FlightFile, w);for (i = 0; iCityNum; i+)total += AdjListi.

9、FlightNum;fprintf(fp, %dn, total);for (i = 0; iCityNum; i+)for (j = 0; jAdjListi.FlightNum; j+)fprintf(fp, %s %s %s , AdjListi.F,CityNamei,CityNameAdjListi.Flightj.EndCity); fprintf(fp, %2d:%2d %2d:%2d %dn, AdjListi.Flightj.StartTime / 60,AdjListi.Flightj.StartTime % 60,AdjListi.Flightj.S

10、topTime / 60,AdjListi.Flightj.StopTime % 60,AdjListi.Flightj.Cost);fclose(fp); return 1;int InsertCity(char *Name) ity = CityNum;AdjListCityNum.FlightNum = 0;AdjListCityNum.TrainNum = 0;CityNum+;return 1;int DelCity(char *Name) lightNum = AdjListi + 1.FlightNum;AdjListi.TrainNum = AdjListi + 1.Train

11、Num;for (j = 0; j AdjListi.FlightNum; j+) lightj.Cost = AdjListi + 1.Flightj.Cost;AdjListi.Flightj.EndCity = AdjListi +1.Flightj.EndCity;strcpy(AdjListi.F, AdjListi +1.F);AdjListi.Flightj.StartTime = AdjListi +1.Flightj.StartTime;AdjListi.Flightj.StopTime = AdjListi +1.Flightj.

12、StopTime; CityNum-;return 1;int InsertTrain(char *train, char *StartCity, char *EndCity, intStartTime, int EndTime, int cost)int i, j; rainAdjListi.TrainNum.Cost = cost;AdjListi.TrainAdjListi.TrainNum.EndCity = j;AdjListi.TrainAdjListi.TrainNum.StartTime = StartTime;AdjListi.TrainAdjListi.TrainNum.S

13、topTime = EndTime; strcpy(AdjListi.TrainAdjListi.TrainN, train); AdjListi.TrainNum+; lightAdjListi.FlightNum.Cost = cost; AdjListi.FlightAdjListi.FlightNum.EndCity = j;AdjListi.FlightAdjListi.FlightNum.StartTime = StartTime;AdjListi.FlightAdjListi.FlightNum.StopTime = EndTime; strcpy(AdjListi

14、.TrainAdjListi.FlightN, flight); AdjListi.FlightNum+;return 1;int DelPath(char *name)int i, j, flag = 0;for (i = 0; iCityNum; i+)for (j = 0; jAdjListi.FlightNum; j+) , name) = 0)flag = 1; break;for (; jAdjListi.FlightNum - 1; j+) lightj.Cost =if (flag)AdjListi.Flightj + 1.Cost;AdjL

15、isti.Flightj.EndCity =AdjListi.Flightj +1.EndCity;1.name);strcpy(AdjListi.F, AdjListi.Flightj +1.StartTime;AdjListi.Flightj.StartTime= AdjListi.Flightj +1.StopTime;AdjListi.Flightj.StopTime= AdjListi.Flightj +AdjListi.FlightNum-; break;for (j = 0; jAdjListi.TrainNum; j+)if (strcmp(AdjList

16、i.T, name) = 0)flag = 1; break;if (flag)for (; jAdjListtracki.Traink.Cost)min = AdjListtracki.Traink.Cost; tmp = k;printf(%s, AdjListtracki.T); printf(%2d:%2d-%2d:%2d,AdjListtracki.Traintmp.StartTime / 60,AdjListtracki.Traintmp.StartTime % 60,AdjListtracki.Traintmp.StopTime / 6

17、0, AdjListtracki.Traintmp.StopTime % 60);elsefor (i-; i0; i-)printf(n%s:, CityNametracki); end = tracki - 1; min = 32767;for (k = 0; kAdjListtracki.Flightk.Cost)min = AdjListtracki.Flightk.Cost;tmp = k;printf(%s, AdjListtracki.F); printf(%2d:%2d-%2d:%2d, AdjListtracki.Flighttmp.StartTim

18、e / 60, AdjListtracki.Flighttmp.StartTime % 60, AdjListtracki.Flighttmp.StopTime / 60, AdjListtracki.Flighttmp.StopTime % 60);printf(n%s: DESTINATION!, CityNametrack0);printf(nMin Cost : %dn, cost);void Dijkstra(int matxDij_MAXNDij_MAXN, int p_start, int p_end, int TravelType)int PreCityDij_MAXN; .n

19、);return -1;fscanf(fp, %d, &CityNum);for (i = 0; iCityNum; i+)fscanf(fp, %s, &CityNamei); AdjListi.city = i;AdjListi.TrainNum = 0;AdjListi.FlightNum = 0;fclose(fp);fp = fopen(TrainFile, r);if (!fp)printf(nError:Cannot Open Train File.n); return -1;fscanf(fp, %d, &num);for (i = 0; inum; i+)fscanf(fp,

20、 %s, &stmp1); rainAdjListj.TrainNum.EndCity = SeekCity(stmp3); rainAdjListj.TrainN, stmp1);fscanf(fp, %d:%d, &hour, &minute);AdjListj.TrainAdjListj.TrainNum.StartTime = hour * 60 + minute;fscanf(fp, %d:%d, &hour, &minute);AdjListj.TrainAdjListj.TrainNum.StopTime = hour * 60 + minute;fscanf(fp

21、, %d, &cost);AdjListj.TrainAdjListj.TrainNum.Cost = cost; AdjListj.TrainNum+;fclose(fp);fp = fopen(FlightFile, r);if (!fp) printf(nError:Cannot Open Flight File.n);return -1;fscanf(fp, %d, &num);for (i = 0; inum; i+)fscanf(fp, %s, &stmp1); lightAdjListj.FlightNum.EndCity = SeekCity(stmp3);strcpy(Adj

22、Listj.FlightAdjListj.FlightN, stmp1); fscanf(fp, %d:%d, &hour, &minute);AdjListj.FlightAdjListj.FlightNum.StartTime = hour * 60 + minute;fscanf(fp, %d:%d, &hour, &minute);AdjListj.FlightAdjListj.FlightNum.StopTime = hour * 60 +minute;fscanf(fp, %d, &cost);AdjListj.FlightAdjListj.FlightNum.Cos

23、t = cost;AdjListj.FlightNum+;fclose(fp); return 1;int SearchMinTime(CityType City, CityType EndCity, int CurTime, int curPathNo, int TravelType) ity = Pathi.City;MinPathi.TraNo = Pathi.TraNo; curPath = curPathNo;MinTime = CurTime - StartTime;elsecurPathNo+;PathcurPathNo.City = City;if (!TravelType)f

24、or (i = 0; i= (CurTime %1440)& (AdjListCity.Traini.StopTime + (CurTime / 1440) * 1440 - StartTimeMinTime)PathcurPathNo.TraNo = i;SearchMinTime(AdjListCity.Traini.EndCity, EndCity, AdjListCity.Traini.StopTime + (CurTime / 1440) * 1440, curPathNo, TravelType);if (AdjListCity.Traini.StartTime(CurTime %

25、 1440)& (AdjListCity.Traini.StopTime + (CurTime / 1440) * 1440 -StartTimeMinTime)PathcurPathNo.TraNo = i;SearchMinTime(AdjListCity.Traini.EndCity, EndCity, AdjListCity.Traini.StopTime + (CurTime / 1440 + 1) * 1440, curPathNo, TravelType);elsefor (i = 0; i= CurTime) &(AdjListCity.Flighti.StopTime + (

26、CurTime / 1440) * 1440 -StartTimeMinTime)PathcurPathNo.TraNo = i;SearchMinTime(AdjListCity.Flighti.EndCity,EndCity, AdjListCity.Flighti.StopTime + (CurTime / 1440) * 1440, curPathNo, TravelType);if (AdjListCity.Flighti.StartTimeCurTime) & (AdjListCity.Flighti.StopTime + (CurTime / 1440) * 1440 - Sta

27、rtTimeMinTime)PathcurPathNo.TraNo = i; SearchMinTime(AdjListCity.Flighti.EndCity,EndCity, AdjListCity.Flighti.StopTime + (CurTime / 1440 + 1) * 1440, curPathNo, TravelType);return 1;int CalcMinTime(int StartCity, int EndCity, int TravelType)int i;MinTime = 32767; curPath = 0;Path0.City = StartCity;i

28、f (!TravelType)for (i = 0; iAdjListStartCity.TrainNum; i+) Path0.TraNo = i;StartTime = AdjListStartCity.Traini.StartTime;SearchMinTime(AdjListStartCity.Traini.EndCity,AdjListStartCity.Traini.StopTime, 0, TravelType);elsefor (i = 0; iAdjListStartCity.FlightNum; i+)Path0.TraNo = i;StartTime = AdjListS

29、tartCity.Flighti.StartTime;SearchMinTime(AdjListStartCity.Flighti.EndCity,AdjListStartCity.Flighti.StopTime, 0, TravelType);if (MinTime = 32767)printf(nNo access to that destination!);return 0;rainMinPath0.TraNo.StartTime;lightMinPath0.TraNo.StartTime;printf(nPath:n);for (i = 0; i = curPath; i+)EndC

30、ity,EndCity,if (!TravelType) printf(%s : %s, CityNameMinPathi.City,AdjListMinPathi.City.TrainMinPathi.TraN);elseprintf(%s : %s, CityNameMinPathi.City,AdjListMinPathi.City.FlightMinPathi.TraN);printf( %2d:%2d-%2d:%2dn,AdjListMinPathi.City.TrainMinPathi.TraNo.StartTime / 60,AdjListMinPathi

31、.City.TrainMinPathi.TraNo.StartTime % 60,AdjListMinPathi.City.TrainMinPathi.TraNo.StopTime / 60,AdjListMinPathi.City.TrainMinPathi.TraNo.StopTime % 60);printf(%s: DESTINATION!, CityNameEndCity);printf(nTime Cost: %2d:%2d, MinTime / 60, MinTime % 60); return 1;int CalcMinCost(int StartCity, int EndCi

32、ty, int TravelType)int maDij_MAXNDij_MAXN;int i, j, min, end;for (i = 0; iCityNum; i+)for (j = 0; jCityNum; j+)maij = -1;if (TravelType = 0)for (i = 0; iCityNum; i+)min = 32767; j = 0;while (jAdjListi.TrainNum)min = 32767;end = AdjListi.Trainj.EndCity; while (end =AdjListi.Trainj.EndCity&jAdjListi.T

33、rainNum)if (AdjListi.Trainj.Costmin)min = AdjListi.Trainj.Cost;j+;maiend = min;elsefor (i =0; iCityNum; i+)min = 32767; j = 0;while (jAdjListi.FlightNum)min = 32767;end = AdjListi.Flightj.EndCity; while (end =AdjListi.Flightj.EndCity&jAdjListi.FlightNum)if (AdjListi.Flightj.Costmin)min = AdjListi.Fl

34、ightj.Cost;j+;maiend = min;Dijkstra(ma, StartCity, EndCity, TravelType);return 1;/=Main()=int main()char nameMAX_STRING_NUM; /城市名char s_cityMAX_STRING_NUM; / 始发站char e_cityMAX_STRING_NUM; / 终点站int Command, cost;int startcity, endcity, traveltype;int s_hour, s_minute, e_hour, e_minute;while (1)CopyRi

35、ght();/ 版权信息ShowMenu(); / 主菜单 scanf(%d, &Command);/ 输入选择 switch (Command) / 对菜单的内容进行选择 case 0: / 退出return 0;case 1: / 添加城市InitSysData(); / 读出文档中已存的信息 printf(n 输入城市名 :);scanf(%s, &name); / 输入城市名 InsertCity(name); / 将城市插入到数组中 SaveSysInfo(); / 把城市的信息写入文档中 printf(System Info Save OK!n);break;case 2: / 删

36、除城市InitSysData(); / 读出文档中已有的信息 printf(n 输入城市名 :);scanf(%s, &name);DelCity(name); / 将城市删除 SaveSysInfo(); / 将处理过的信息写入文档中 printf(System Info Save OK!n);break;case 3: / 添加路线InitSysData();printf( 起始站城市名 :); scanf(%s, &s_city); /起始站printf( 终点站城市名 :);scanf(%s, &e_city); /终点站printf( 类型(列车 0，航班 1):);scanf(%d, &traveltype);printf( 输入列车 / 飞机班次 :);scanf(%s, &name);printf( 起始时刻 (00:00 ，24 小时制 ):);scanf(%2d:%2d, &s_hour, &s_minute);printf( 到达时刻 (00:00 ，24 小时制 ):);scanf(%2d:%2d, &e_hour, &e_minute);printf( 票价 :);scanf(%d, &cost);if (traveltype)InsertFlight(name, s_city, e_city, s_hour * 60 + s_minu