-
Notifications
You must be signed in to change notification settings - Fork 7
/
Copy pathd.php
160 lines (139 loc) · 6.7 KB
/
d.php
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
<?php
header("Content-type:text/json");
/*
* 用迪杰斯特拉算法求校园中的最短路径
*/
//将邻接矩阵中的key定义校园中实际的地点名字,共有二十三个地点
$start_site = $_GET['start_site'];
$end_site = $_GET['end_site'];
$location_name = [
'a' => "培训楼",
'b' => "嘉风苑",
'c' => "一食堂",
'd' => "和风苑",
'e' => "篮球/足球场",
'f' => "南门",
'g' => "清风苑",
'h' => "北门",
'i' => "二食堂",
'j' => '校医院/游泳馆',
'k' => '特教楼(励志楼)',
'l' => '汇贤楼(学院楼)',
'm' => '畅风苑',
'n' => '雅风苑',
'o' => '图书馆',
'p' => '惠风苑',
'q' => '三食堂',
'r' => '弘德楼',
's' => '知行楼/化学/物理学院',
't' => '综合办公楼',
'u' => '集贤楼',
'v' => '校友会堂',
'w' => '美术/音乐学院',
];
//将地图转化成为邻接矩阵,权值是距离,时间
$ljjz = [
'a' => ['b' => 165, 'btime' => 3, 'i' => 302, 'itime' => 5,],
'b' => ['a' => 165, 'atime' => 3, 'i' => 343, 'itime' => 5, 'c' => 360, 'ctime' => 5, 'h' => 300, 'htime' => 4,],
'c' => ['b' => 360, 'btime' => 5, 'd' => 150, 'dtime' => 2, 'i' => 300, 'itime' => 4, 'o' => 230, 'otime' => 4, 'r' => 363, 'rtime' => 5,],
'd' => ['h' => 193, 'htime' => 3, 'c' => 150, 'ctime' => 2, 'r' => 284, 'rtime' => 4, 'e' => 149, 'etime' => 3,],
'e' => ['d' => 193, 'dtime' => 3, 'h' => 159, 'htime' => 3, 'r' => 300, 'rtime' => 4, 't' => 150, 'ttime' => 2,],
'f' => ['p' => 209, 'ptime' => 3, 'w' => 160, 'wtime' => 2,],
'g' => ['i' => 229, 'itime' => 3,],
'h' => ['b' => 300, 'btime' => 4, 'd' => 193, 'dtime' => 3, 'e' => 159, 'etime' => 3,],
'i' => ['a' => 301, 'atime' => 5, 'b' => 343, 'btime' => 5, 'c' => 300, 'ctime' => 4, 'o' => 190, 'otime' => 3, 'k' => 250, 'ktime' => 3, 'l' => 378, 'ltime' => 6, 'j' => 118, 'jtime' => 2, 'g' => 229, 'gtime' => 3,],
'j' => ['i' => 188, 'itime' => 2, 'l' => 206, 'ltime' => 3,],
'k' => ['i' => 250, 'itime' => 3, 'o' => 250, 'otime' => 3, 'q' => 340, 'qtime' => 5, 'n' => 244, 'ntime' => 4, 'm' => 254, 'mtime' => 4, 'l' => 233, 'ltime' => 4, 's' => 150, 'stime' => 2,],
'l' => ['j' => 206, 'jtime' => 3, 'i' => 378, 'itime' => 6, 'k' => 233, 'ktime' => 4,],
'm' => ['k' => 254, 'ktime' => 4, 'n' => 202, 'ntime' => 3,],
'n' => ['k' => 244, 'ktime' => 4, 'm' => 202, 'mtime' => 3, 'p' => 155, 'ptime' => 2],
'o' => ['k' => 250, 'ktime' => 3, 'i' => 190, 'itime' => 3, 'c' => 230, 'ctime' => 4, 'r' => 409, 'rtime' => 6, 's' => 340, 'stime' => 4,],
'p' => ['n' => 155, 'ntime' => 2, 'q' => 148, 'qtime' => 2, 'f' => 209, 'ftime' => 3, 'w' => 203, 'wtime' => 3,],
'q' => ['k' => 340, 'ktime' => 5, 's' => 50, 'stime' => 1, 'v' => 506, 'vtime' => 7, 'w' => 148, 'wtime' => 2, 'p' => 148, 'ptime' => 2,],
'r' => ['c' => 363, 'ctime' => 5, 'd' => 284, 'dtime' => 4, 'e' => 300, 'etime' => 4, 't' => 225, 'ttime' => 3, 'u' => 476, 'utime' => 7, 's' => 556, 'stime' => 8, 'o' => 409, 'otime' => 6],
's' => ['o' => 340, 'otime' => 4, 'r' => 556, 'rtime' => 8, 'u' => 431, 'utime' => 6, 'q' => 50, 'qtime' => 1, 'k' => 150, 'ktime' => 2,],
't' => ['e' => 150, 'etime' => 2, 'r' => 255, 'rtime' => 3, 'u' => 374, 'utime' => 5, 'v' => 210, 'vtime' => 4,],
'u' => ['s' => 431, 'stime' => 6, 'r' => 476, 'rtime' => 7, 't' => 374, 'ttime' => 5, 'v' => 30, 'vtime' => 1,],
'v' => ['q' => 506, 'qtime' => 7, 't' => 210, 'ttime' => 4, 'u' => 30, 'utime' => 1,],
'w' => ['q' => 148, 'qtime' => 2, 'p' => 203, 'ptime' => 3, 'f' => 160, 'ftime' => 2,],
];
$N = range('a', 'z');//未找到点
$Y = [$start_site => 0];//已找到点
$note = [$start_site => [$start_site]];//记录寻点过程中已找到的最小距离点
//过程计算
jsuan($Y, $note, $ljjz, $N, $end_site);
//输出结果
//echo $Y[$end_site]."米";//$Y的最后一个单元即为：起点到终点的最距离
//返回前端的格式
$name_array = [];
foreach ($note[$end_site] as $value) {
array_push($name_array, $location_name[$value]);
};
//$NOTE的最后一个单元即为：起点到终点的所经过的点
$result = [];
//统计最短路径大概历时
$length = count($note[$end_site]);
for ($i = 0; $i < $length - 1; $i++) {
$first = $note[$end_site][$i];
$second = $note[$end_site][$i + 1];
$result[$i]['name'] = $name_array[$i];
$result[$i]['time'] = $ljjz[$first][$second . 'time'];
$result[$i]['length'] = $ljjz[$first][$second];
}
for ($i = 0; $i < $length; $i++) {
$result[$i]['name'] = $name_array[$i];
}
echo json_encode($result);
//djstl算法
function jsuan(&$y, &$note, $data, $n, $end_site)
{
$end = $end_site; //定义终点
//1.计算所有已找到点到所有未找到点的距离,并存储"最小点","最小值"和"父顶点"
$yn = [];//存储$y点到$n点的距离
$min_key = '';//定义找到的"最小距离"
$min_val = 123456789;//定义找到的"最小距离"
$parent_key = '';//定义找到的"最小点"的父点(即最小点相连的点)
foreach ($y as $key => $k_value) {
foreach ($n as $n_value) {
//在数据中查找y对应的n点:有对应的值则判断记录
if (isset($data[$key][$n_value])) {
//取出y到n的距离
$range = $data[$key][$n_value];
//得到"y到起点"+n的距离
$range = $k_value + $range;
//yn距离中没有存储n的距离,则直接加入;
//否则判断是否比其小;晓得替换之前的值加入
if (isset($yn[$n_value])) {
if ($range < $yn[$n_value]) {
$yn[$n_value] = $range;//将n设为更小的加入$yn
}
} else {
$yn[$n_value] = $range;
}
//存储"最小点","最小值","父顶点"
if ($range < $min_val) {
$min_val = $range;
$min_key = $n_value;
$parent_key = $key;
}
} else {
//在数据中查找y对应的n点:并且$yn中也没有,如果有则为上个点找到的点,否则将值设为无穷大
if (!isset($yn[$n_value])) {
$yn[$n_value] = 123456789;
}
}
}//$n结束
}//$y结束
//2.生成新note
//将找到的最小点,加入$note,其内容为他的父点加上它本身
$_find_new = $note[$parent_key];
array_push($_find_new, $min_key);
$note[$min_key] = $_find_new;
//3.生成新y
$y[$min_key] = $min_val;
//4.生成新n
$k = array_search($min_key, $n);
unset($n[$k]);
if ($min_key != $end) jsuan($y, $note, $data, $n, $end_site);
}
?>