1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
| #include<iostream>
#include<cstdio>
#include<cstring>
#include<conio.h>
#define MAXLEN 500
#define MAX 0x7FFFFFFF
using namespace std;
string CityList[MAXLEN];
int map[MAXLEN][MAXLEN]= {0};
int N;
bool check_input(int x,int y,int w,int N){
if (w<0 || x==y || x>N || y>N || (map[x][y]!=0 && map[x][y]!=MAX)|| (map[x][y]!=0 && map[x][y]!=MAX)){
cout<<"该组数据不符合规范，请重新输入"<<endl;
getch();
return true;
}
return false;
}
void Readin() {
int M,x,y,w;
memset(map,sizeof(map),0);
cout<<"请输入城市总数:";
cin>>N;
cout<<"请输入路径数量:";
cin>>M;
if (M>(N+1)*N/2){
cout<<"您输入的路径数量大于最大可能路径数量"<<endl;
getch();
return;
}
cout<<endl;
for (int i=1; i<=N; i++) {
printf("第%d个城市名称:",i);
cin>>CityList[i];
}
printf("城市x编号 城市y编号 路径长度\n");
printf("-----------------------------\n");
for (int i=1; i<=M; i++) {
do{
printf("第%d组:",i);
cin>>x>>y>>w;
}while(check_input(x,y,w,N));
map[x][y]=w;
map[y][x]=w;
}
for (int i=1; i<=N; i++) {
for (int j=1; j<=N; j++)
if (i!=j && map[i][j]==0) map[i][j]=MAX;
}
}
void Mapprint(int n=N) {
if (N==0) return;
cout<<"\t";
for (int i=1; i<=n; i++) cout<<CityList[i]<<"\t";
cout<<endl;
for (int i=1; i<=n*9; i++) cout<<'-';
cout<<endl;
for (int i=1; i<=n; i++) {
cout<<CityList[i]<<"\t";
for (int j=1; j<=n; j++)
if (map[i][j]!=MAX) cout<<map[i][j]<<"\t";
else cout<<"-\t";
cout<<endl;
}
}
void Mapadd() {
int n,x,y,w,m;
cout<<"请输入增加的城市个数:";
cin>>n;
cout<<"请输入新增的路径个数:";
cin>>m;
// if (m>(N*n+(n+1)*n/2)){
// cout<<"您输入的路径数量大于最大可能路径数量"<<endl;
// getch();
// return;
// }
cout<<endl;
for(int i=N+1; i<=N+n; i++) {
printf("第%d个城市的名称:",i);
cin>>CityList[i];
}
printf("\n城市x编号 城市y编号 路径长度\n");
printf("-----------------------------\n");
for (int i=1; i<=m; i++) {
do{
printf("第%d组:",i);
cin>>x>>y>>w;
}while (check_input(x,y,w,N+n));
map[x][y]=w;
map[y][x]=w;
}
for (int i=1;i<=N+n;i++)
for(int j=1;j<=N+n;j++)
if (i!=j && map[i][j]==0) map[i][j]=MAX;
N=N+n;
}
void Delcol(int x) {
int i,j;
if (x>N or x<1) return;
for (i=1; i<=N; i++) {
for (j=x; j<N; j++)
map[i][j]=map[i][j+1];
map[i][j]=0;
}
}
void Delrow(int x) {
int i;
if (x>N or x<1) return;
for (i=x; i<N; i++)
memcpy(map[i],map[i+1],sizeof(int)*(N));
memset(map[i],0,N-1);
}
void Delname(int x) {
int i;
for (i=x; i<N; i++) CityList[i]=CityList[i+1];
CityList[i]= {0};
}
void Mapdel() {
int x;
cout<<"请输入您要删除的城市编号:";
cin>>x;
Delname(x);
Delcol(x);
Delrow(x);
N--;
}
void Mapmod(){
string x,y;
int i,j,w;
cout<<"请输入您要修改的两个城市的名称"<<endl;
cout<<"城市A:"; cin>>x;
cout<<"城市B:"; cin>>y;
cout<<"请输入修改值(输入值<=0删除路径):"; cin>>w;
for (i=1;i<=N;i++)
if (x==CityList[i]) break;
for (j=1;i<=N;j++)
if (y==CityList[j]) break;
if (i==N && CityList[i]!=x){
cout<<"无法找到城市A"<<endl;
getch();
return;
}
if (j==N && CityList[j]!=y){
cout<<"无法找到城市B"<<endl;
getch();
return;
}
if (w<=0) {
map[i][j]=MAX;
map[j][i]=MAX;
}
else{
map[i][j]=w;
map[j][i]=w;
}
}
bool check(bool* arr,int n){
for (int i=1;i<=n;i++)
if (!arr[i]) return true;
return false;
}
void Dijkstra(){
int d,s=1,pos,m;
cout<<"请输入目的地城市（默认出发城市即编号为1的城市）"<<endl;
cin>>d;
if (d>N){
cout<<"您输入的城市超出范围"<<endl;
getch();
return;
}
int dis[MAXLEN]={0};
bool is_v[MAXLEN];
string route[MAXLEN];
memset(is_v,0,sizeof(bool)*MAXLEN);
for (int i=1;i<=N;i++){
dis[i]=map[s][i];
route[i]=CityList[s]+"-->"+CityList[i];
}
dis[s]=0;
is_v[s]=true;
while (check(is_v,N)){
pos=0;
m=MAX;
for (int i=1;i<=N;i++)
if (!is_v[i] && m>dis[i]){
m=dis[i];
pos=i;
}
is_v[pos]=true;
for (int i=1;i<=N;i++)
if (!is_v[i] && dis[pos]+map[pos][i]>=0) {
if (dis[i]>dis[pos]+map[pos][i]){
dis[i]=dis[pos]+map[pos][i];
route[i]=route[pos]+"-->"+CityList[i];
}
}
}
if (dis[d]==0){
cout<<"不存在抵达该城市的路径"<<endl;
getch();
return;
}
cout<<"最短路径长度:";
cout<<dis[d]<<endl;
cout<<route[d]<<endl;
getch();
}
void logo(){
system("cls");
printf(" ____ _ _ __ __ \n");
printf(" / __ \(_) (_) /_______/ /__________ _\n");
printf(" / / / / / / / //_/ ___/ __/ ___/ __ `/\n");
printf(" / /_/ / / / / ,< (__ ) /_/ / / /_/ / \n");
printf(" /_____/_/_/ /_/|_/____/\\__/_/ \\__,_/ \n");
printf(" /___/ \n");
cout<<" --code by Yuuki | cc"<<endl;
cout<<"============================================="<<endl;
Mapprint();
cout<<"============================================="<<endl;
cout<<" 1.录入城市路径 "<<endl;
cout<<" 2.增加城市路径 "<<endl;
cout<<" 3.编辑城市路径 "<<endl;
cout<<" 4.删除城市 "<<endl;
cout<<" 5.计算最短路径 "<<endl;
cout<<" 0.退出 "<<endl;
}
void init(){
N=6;
CityList[1]="南京";
CityList[2]="镇江";
CityList[3]="常州";
CityList[4]="苏州";
CityList[5]="无锡";
CityList[6]="上海";
map[1][2]=1;
map[2][1]=1;
map[2][4]=3;
map[4][2]=3;
map[4][6]=15;
map[6][4]=15;
map[5][6]=4;
map[6][5]=4;
map[5][3]=5;
map[3][5]=5;
map[1][3]=12;
map[3][1]=12;
map[2][3]=9;
map[3][2]=9;
map[3][4]=4;
map[4][3]=4;
map[4][5]=13;
map[5][4]=13;
for (int i=1;i<=N;i++)
for (int j=1;j<=N;j++)
if (i!=j && map[i][j]==0) map[i][j]=MAX;
}
int main() {
string choice;
N=0;
init();
while (true){
logo();
cin>>choice;
switch(choice[0]){
case '1': Readin(); break;
case '2': Mapadd(); break;
case '3': Mapmod(); break;
case '4': Mapdel(); break;
case '5': Dijkstra(); break;
case '0': return 0;
default:
continue;
}
}
return 0;
}
|
