数据结构上机题答案.docVIP

数据结构上机实验实习题及源程序 将若干城市的信息存入一个带头结点的单链表，结点中的城市信息包括城市名、城市的位置坐标。要求： 给定一个城市名，返回其位置坐标； 给定一个位置坐标P和一个距离D，返回所有与P的距离小于等于D的城市。 #include stdio.h #include string.h #include math.h typedef int Length; typedef struct { int x; int y; }coordinate; typedef struct cityInfo { char cityName[10]; coordinate cityCoor; struct cityInfo* next; }citylink; void addCity(citylink*); void insertCity(citylink*); void delCity(citylink); void amendCity(char*); void list(void); void coordinateSureCityname(void); void nearerCity(coordinate,Length); void shortestCitys(void); citylink *head; citylink *end; void addCity(citylink* newCity) { end- next = newCity; end = newCity; newCity- next = NULL; } void insertCity(citylink* newcity) { int number,i; citylink *p,*q; p = head; printf( insert where\n ); scanf( %d ,number); for(i = 1;i number;i++) { p = p- next; } q = p- next; p- next = newcity; newcity- next = q; } void delCity() { int number,i; citylink *p; p = head; printf( please input the number of city you want to del\n ); scanf( %d ,number); if(1 == number) { head = head- next; } for(i = 2;i number;i++) { p = p- next; } p- next = p- next- next; } void amendCity() { int x,y,result; citylink *p; char cityName[10]; printf( please in put city ’s old name\n ); scanf( %s ,cityName); fflush(stdin); p = head; while (p) { result = strcmp(p- cityName,cityName); if (0 == result) { printf( please input city ’s new name!!\n ); scanf( %s ,p- cityName); fflush(stdin); printf( please input city ’s new coordinate like this 88,99!!\n ); scanf( %d,%d ,x,y); p- cityCoor.x = x; p- cityCoor.y = y; break; } p = p- next; } if (result != 0) { printf( T