-
Notifications
You must be signed in to change notification settings - Fork 0
/
road.java
221 lines (209 loc) · 5.76 KB
/
road.java
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
package subway;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
public class road {
static int MaxInt = 100000;
static int i;
static int stanum;// 所经站点数
static Map<String, Integer> map = new HashMap<String, Integer>();
static Map<String, String> id = new HashMap<String,String>();
public static boolean IsT(String name[], String nam, int n) {
int i = 0;
while (i < n) {
if (name[i]!=null&&name[i].equals(nam)) {
return true;
}
i++;
}
return false;
} // 检查是不是节点
static int Check(String name[], String nam, int n) {
int i = 0;
while (i < n && !name[i].equals(nam)) {
i++;
}
return i;
}
static void print(int pa[], String nam[], int v, int i)// V表示是目地结点
{
if (pa[i] >= 0) {
print(pa, nam, v, pa[i]);
if(map.get(nam[pa[i]])==2)
System.out.println(stanum + " " + nam[pa[i]]+"(可换乘"+id.get(nam[pa[i]])+")");
else
System.out.println(stanum + " " + nam[pa[i]]);
stanum = stanum + 1;
}
}
static double Dijkstra(double Map[], int path[], int n, int v, int d) {
double min, ks;
int u, t;
double dist[] = new double[n + 1];
int s[] = new int[n + 1];
for (int i = 0; i < n; i++) {
dist[i] = Map[n * v + i];
s[i] = 0;
if (i != v && dist[i] < MaxInt) {
path[i] = v;
} else
path[i] = -1;
}
s[v] = 1;
for (int i = 0; i < n - 1; i++) {
min = MaxInt;
u = v;
for (int j = 0; j < n; j++) {
if (s[j] == 0 && dist[j] < min) {
u = j;
min = dist[j];
}
}
s[u] = 1;
for (t = 0; t < n; t++) {
if (s[t] == 0 && dist[u] + Map[n * u + t] < dist[t]) {
dist[t] = (float) (dist[u] + Map[n * u + t]);
path[t] = u;
}
}
}
ks = dist[d];// 现在只返回人要的那个目的值
return ks;
// delete dist;
} // Dijkstra算法内容
public static void main(String[] args) {
int n = 330;
double Map[] = new double[330 * 330];
double Ma[] = Map;
for (int i = 0; i < n * n; i++)
Map[i] = MaxInt;
String name[] = new String[330];
String nam[] = name;
int path[] = new int[330];
int pa[] = path;
List list =Arrays.asList(name);
int x=0;
try {
BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(new File("E:/subway.txt"))));
String lineTxt = null;
while ((lineTxt = br.readLine()) != null) {
String na=null;
String[] names = lineTxt.split(" ");
String iid=names[0];
for(int i=0;i<names.length-1;i++)
names[i]=names[i+1];
for (String namer : names) {
if (map.keySet().contains(namer)) {
int temp=0;
for(int i=0;i<names.length;i++) {
if(namer.equals(names[i])) temp++;
}
if(temp==1) {
map.put(namer, (map.get(namer) + 1));
id.put(namer,id.get(namer)+","+iid);
}
} else {
name[x] =namer;
x++;
map.put(namer, 1);
id.put(namer, iid);
}
if(na!=null) {
Map[n * list.indexOf(namer) + list.indexOf(na)] = 2;
Map[n * list.indexOf(na) + list.indexOf(namer)] = 2;
}
na=namer;
}
}
br.close();
}catch (Exception e) {
System.err.println("read errors :" + e);
}
for (i = 0; i < n; i++)
Map[n * i + i] = 0;
String start, dest,road;
double race = 21;
System.out.print("请输入操作(查询线路为a,查询最短路径为b):");
Scanner cin = new Scanner(System.in);
String temp=cin.nextLine();
if(temp.equals("a")) {
System.out.print("请输入查询线路:");
road = cin.nextLine();
try {
BufferedReader bw = new BufferedReader(new InputStreamReader(new FileInputStream(new File("E:/subway.txt"))));
String line = null;
int have=0;
while ((line = bw.readLine()) != null) {
String[] names = line.split(" ");
String iid=names[0];
if(iid.equals(road)) {
have=1;
for (String namer : names) {
if(id.get(namer)!=null) {
System.out.println(namer+"("+id.get(namer)+")");
}
}
}
}
if(have==0) System.out.println("线路不存在");
bw.close();
}catch (Exception e) {
System.err.println("错误");
}
}
else if(temp.equals("b")) {
System.out.print("请输入起点站名:");
start = cin.nextLine();
while (!IsT(name, start, n)) {
System.out.print("输入错误,请重新输入起点站名:");
start = cin.nextLine();
}
System.out.print("请输入终点站名:");
dest = cin.nextLine();
while (!IsT(name, dest, n)) {
System.out.print("输入错误,请重新输入终点站名:");
dest = cin.nextLine();
}
if (IsT(name, dest, n)) {
float distan = (float) Dijkstra(Ma, pa, n, Check(nam, start, n), Check(nam, dest, n));// 能查出此结点到其他点最短路径
int s, d;
s = Check(nam, start, n);
d = Check(nam, dest, n);
stanum = 0;
print(pa, nam, s, d);
System.out.println(stanum + " " + dest);
int fen = (int) (distan * 1000 / race / 60);
int miao = ((int) (distan * 1000 / race)) % 60;
int r;
if (distan > 6) {
if (distan > 12) {
if (distan > 32) {
r = (int) (6 + distan / 20);
} else
r = (int) (4 + distan / 10);
} else
r = 4;
} else
r = 3;
System.out.println("总运行距离为:" + distan + "km");
System.out.println("途径总站点数为:" + stanum);
System.out.println("运行时间" + fen + "分" + miao + "秒");
System.out.println("总票价为:" + r + "元");
} else {
System.out.println();
System.out.println("please choise your stations!");
}
}
return;
}
}