公交查询系统 - 图文(9)

BG[8].theStationToOthersPath[15]=80;

BG[9].theStationToOthersPath[8]=160;

BG[10].theStationToOthersPath[11]=100; BG[10].theStationToOthersPath[24]=130; BG[10].theStationToOthersPath[25]=110;

BG[11].theStationToOthersPath[2]=100; BG[11].theStationToOthersPath[10]=100; BG[11].theStationToOthersPath[12]=50;

BG[12].theStationToOthersPath[11]=50; BG[12].theStationToOthersPath[13]=100;

BG[13].theStationToOthersPath[12]=100; BG[13].theStationToOthersPath[14]=150;

BG[14].theStationToOthersPath[13]=150; BG[14].theStationToOthersPath[15]=100; BG[14].theStationToOthersPath[29]=120;

BG[15].theStationToOthersPath[6]=250; BG[15].theStationToOthersPath[8]=80; BG[15].theStationToOthersPath[14]=100; BG[15].theStationToOthersPath[16]=120;

BG[16].theStationToOthersPath[15]=120; BG[16].theStationToOthersPath[17]=60;

BG[17].theStationToOthersPath[16]=60; BG[17].theStationToOthersPath[18]=70;

BG[18].theStationToOthersPath[17]=70; BG[18].theStationToOthersPath[19]=90;

BG[19].theStationToOthersPath[18]=90; BG[19].theStationToOthersPath[20]=190;

BG[20].theStationToOthersPath[19]=190; BG[20].theStationToOthersPath[21]=130;

BG[21].theStationToOthersPath[20]=130; BG[21].theStationToOthersPath[22]=100;

34

BG[21].theStationToOthersPath[28]=220;

BG[22].theStationToOthersPath[21]=100; BG[22].theStationToOthersPath[23]=110;

BG[23].theStationToOthersPath[22]=110; BG[23].theStationToOthersPath[24]=120;

BG[24].theStationToOthersPath[10]=130; BG[24].theStationToOthersPath[23]=120;

BG[25].theStationToOthersPath[10]=110; BG[25].theStationToOthersPath[26]=150;

BG[26].theStationToOthersPath[25]=150; BG[26].theStationToOthersPath[27]=130;

BG[27].theStationToOthersPath[26]=130; BG[27].theStationToOthersPath[28]=80;

BG[28].theStationToOthersPath[21]=220; BG[28].theStationToOthersPath[27]=80; BG[28].theStationToOthersPath[29]=60;

BG[29].theStationToOthersPath[14]=120; BG[29].theStationToOthersPath[28]=60;

FILE * fp;

int m = fopen_s(&fp,\,\);

fwrite(BG,sizeof(struct busGraph),MAX_STATION,fp); fclose(fp);

FILE * fpp;

m = fopen_s(&fpp,\,\);

fread(BG,sizeof(struct busGraph),MAX_STATION,fpp); fclose(fpp);

// strcpy(BG[35].stationName,\长沙\

for(int i = 0; i <30 ; i++) {

printf(\,BG[i].stationName); }

35

printf(\);

for(int j = 0 ; j < 30 ; j++) {

for(int i = 0 ; i < 30 ; i++) {

if(BG[j] . theStationToOthersPath[i]!=INT_MAX) printf(\,BG[j] . theStationToOthersPath[i]); }

printf(\); }

system(\); return 0; }

3、 后台路径文件

#include #include #include using namespace std; #define MAX_USER 100 #define MAX_STATION 50 #define MAX_LINE 10 struct busLinesInformation {

int saveStationInLine[MAX_STATION]; int stationCount; };

int main() {

struct busLinesInformation lines[MAX_LINE];

for(int i = 0 ; i < MAX_LINE ; i++) {

lines[i].stationCount = 0;

for(int j = 0 ; j < MAX_STATION; j++ ) {

lines[i].saveStationInLine[j] = -1; } }

lines[0].saveStationInLine[0] = 0; lines[0].saveStationInLine[1] = 1;

36

lines[0].saveStationInLine[2] = 2; lines[0].saveStationInLine[3] = 3; lines[0].saveStationInLine[4] = 4; lines[0].saveStationInLine[5] = 5; lines[0].saveStationInLine[6] = 6; lines[0].saveStationInLine[7] = 7; lines[0].saveStationInLine[8] = 8; lines[0].saveStationInLine[9] = 9; lines[0]. stationCount = 10;

lines[1].saveStationInLine[0] = 0; lines[1].saveStationInLine[1] = 1; lines[1].saveStationInLine[2] = 2; lines[1].saveStationInLine[3] = 3; lines[1].saveStationInLine[4] = 4; lines[1].saveStationInLine[5] = 5; lines[1].saveStationInLine[6] = 6; lines[1].saveStationInLine[7] = 15; lines[1].saveStationInLine[8] = 14; lines[1].saveStationInLine[9] = 29; lines[1].saveStationInLine[10] = 28; lines[1].saveStationInLine[11] = 21; lines[1]. stationCount = 12;

lines[2].saveStationInLine[0] = 0; lines[2].saveStationInLine[1] = 1; lines[2].saveStationInLine[2] = 2; lines[2].saveStationInLine[3] = 11; lines[2].saveStationInLine[4] = 12; lines[2].saveStationInLine[5] = 13; lines[2].saveStationInLine[6] = 14; lines[2].saveStationInLine[7] = 15; lines[2].saveStationInLine[8] = 8; lines[2].saveStationInLine[9] = 9; lines[2]. stationCount = 10;

lines[3].saveStationInLine[0] = 9; lines[3].saveStationInLine[1] = 8; lines[3].saveStationInLine[2] = 15; lines[3].saveStationInLine[3] = 14; lines[3].saveStationInLine[4] = 29; lines[3].saveStationInLine[5] = 28; lines[3].saveStationInLine[6] = 27; lines[3].saveStationInLine[7] = 26;

37

lines[3].saveStationInLine[8] = 25; lines[3].saveStationInLine[9] = 24; lines[3].saveStationInLine[10] = 10; lines[3]. stationCount = 11;

lines[4].saveStationInLine[0] = 21; lines[4].saveStationInLine[1] = 22; lines[4].saveStationInLine[2] = 23; lines[4].saveStationInLine[3] = 24; lines[4].saveStationInLine[4] = 10; lines[4].saveStationInLine[5] = 11; lines[4].saveStationInLine[6] = 2; lines[4].saveStationInLine[7] = 1; lines[4].saveStationInLine[8] = 0; lines[4]. stationCount = 9;

lines[5].saveStationInLine[0] = 9; lines[5].saveStationInLine[1] = 8; lines[5].saveStationInLine[2] = 7; lines[5].saveStationInLine[3] = 6; lines[5].saveStationInLine[4] = 15; lines[5].saveStationInLine[5] = 16; lines[5].saveStationInLine[6] = 17; lines[5].saveStationInLine[7] = 18; lines[5].saveStationInLine[8] = 19; lines[5].saveStationInLine[9] = 20; lines[5].saveStationInLine[10] = 21; lines[5]. stationCount = 11;

FILE * fp;

int m = fopen_s(&fp,\,\);

fwrite(lines,sizeof(struct busLinesInformation),MAX_LINE,fp); fclose(fp);

FILE * fpp;

int n = fopen_s(&fpp,\,\);

fread(lines,sizeof(struct busLinesInformation),MAX_LINE,fpp); fclose(fpp);

for(int i = 0 ; i < 6 ; i++) {

//printf(\

printf(\, i);

38

for(int j = 0 ; j < lines[i].stationCount;j++)