数据结构课程设计全国交通咨询模拟.docVIP

数据结构课程设计全国交通咨询模拟 #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 #define MAX_TRAFFIC_NUM 10 const char CityFile[] =E:\\city.txt; const char TrainFile[] =E:\\train.txt; const char FlightFile[] =E:\\flight.txt; typedef short int CityType; typedef struct TrafficNode { char name[MAX_STRING_NUM]; //班次 int StartTime,StopTime; //起止时间 int EndCity; //该有向边指向的顶点在数组中的位置，即该城市编号 int Cost; //票价 } TrafficNodeDat; typedef struct VNode { CityType city; int TrainNum,FlightNum; //标记下面Train数组和F