最短路各种算法时间分析(转载)

最短路各种算法时间分析(转载)
分别有下面这几种算法（heap写了好久 T T 。。）

其中未注明LIST的SPFA 和 dij 是邻接矩阵的形式。

heap是手写的堆，邻接表存图。priority指的是调用C++里的STL。
[cpp] view plain copy
1. Dijkstra
2. Dijkstra_priority
3. Dijkstra_List
4. Dijkstra_List_priority
5. Dijkstra_heap
6. SPFA
7. SPFA_List
8. Floyd
9. Bellman
稠密图我建图是任意两点均有路径，对角线都是0。。求得的最短路所有起点都是1，终点都是n（矩阵的大小）

下面是稠密图的时间统计，因为矩阵不能开太大，所以最大开了1250*1250。除了n = 10 都是秒过就统计一次，其他均生成三次数据。

时间单位是ms。

稠密图总结：（可以是用邻接矩阵的情况）

1、如果n不大，可以用邻接矩阵的话，dijkstra是最好的选择，写起来比较快而且速度也很快。其次是SPFA，写起来比较好写。

2、floyd 这个算法，n大于300就最好不要用了，很有可能跑1秒以上了。

3、bellman-ford ，n大于200就不要用了，比floyd还耗时间 = =。。。

稀疏图的m 是边数，n是点数。

稀疏图总结：（前面的n比较小时可以用邻接矩阵，后面的floyd 啊 dijkstra等不能使用邻接矩阵的就删掉不考虑了）

1、稀疏图，明显感觉用邻接表的算法占优势了。

2、bellman 超过50000边就不要用了。

3、heap的表现可以说是最好的。

4、超过3000个点就不要用dijkstra 加邻接表不加任何优化的那种。

5、超过500000条边就不要用SPFA加邻接表了。

6、综上，dijkstra + priority 邻接表是最好的选择。虽然比heap慢一点，跑3W点 300W边和heap没差多少。

7、priority坏处就是，不能在队列里修改值，如果进队多次，可能空间满了。。

8、特别恶心的可以用heap ，一般的恶心用priority足以^ ^

附稠密图和稀疏图的时间统计

稠密图
[cpp] view plain copy
1. n = 10;*************************************
2. Dijkstra time is 0
3. Dijkstra_priority time is 0
4. Dijkstra_List time is 0
5. Dijkstra_List_priority time is 0
6. Dijkstra_heap time is 0
7. SPFA time is 0
8. SPFA_List time is 0
9. Floyd time is 0
10. Bellman time is 0
11. The answer of SPFA is 5782
12. The answer of SPFA_List is 5782
13. The answer of Dijkstra is 5782
14. The answer of Dijkstra_priority is 5782
15. The answer of Dijkstra_List is 5782
16. The answer of Dijkstra_List_priority is 5782
17. The answer of Floyd is 5782
18. The answer of BellmanFord is 5782
19. The answer of Dijkstra_Heap is 5782
20. _________________________________________________
21. n == 100;********************************
22. Dijkstra time is 0
23. Dijkstra_priority time is 0
24. Dijkstra_List time is 1
25. Dijkstra_List_priority time is 0
26. Dijkstra_heap time is 1
27. SPFA time is 0
28. SPFA_List time is 1
29. Floyd time is 14
30. Bellman time is 27
31. The answer of SPFA is 2400
32. The answer of SPFA_List is 2400
33. The answer of Dijkstra is 2400
34. The answer of Dijkstra_priority is 2400
35. The answer of Dijkstra_List is 2400
36. The answer of Dijkstra_List_priority is 2400
37. The answer of Floyd is 2400
38. The answer of BellmanFord is 2400
39. The answer of Dijkstra_Heap is 2400
40. _________________________________________________
41. Dijkstra time is 0
42. Dijkstra_priority time is 0
43. Dijkstra_List time is 0
44. Dijkstra_List_priority time is 1
45. Dijkstra_heap time is 0
46. SPFA time is 1
47. SPFA_List time is 0
48. Floyd time is 16
49. Bellman time is 27
50. The answer of SPFA is 365
51. The answer of SPFA_List is 365
52. The answer of Dijkstra is 365
53. The answer of Dijkstra_priority is 365
54. The answer of Dijkstra_List is 365
55. The answer of Dijkstra_List_priority is 365
56. The answer of Floyd is 365
57. The answer of BellmanFord is 365
58. The answer of Dijkstra_Heap is 365
59. _________________________________________________
60. Dijkstra time is 1
61. Dijkstra_priority time is 0
62. Dijkstra_List time is 1
63. Dijkstra_List_priority time is 1
64. Dijkstra_heap time is 0
65. SPFA time is 0
66. SPFA_List time is 1
67. Floyd time is 15
68. Bellman time is 29
69. The answer of SPFA is 1411
70. The answer of SPFA_List is 1411
71. The answer of Dijkstra is 1411
72. The answer of Dijkstra_priority is 1411
73. The answer of Dijkstra_List is 1411
74. The answer of Dijkstra_List_priority is 1411
75. The answer of Floyd is 1411
76. The answer of BellmanFord is 1411
77. The answer of Dijkstra_Heap is 1411
78. _________________________________________________
79. n = 150;*************************************
80. Dijkstra time is 1
81. Dijkstra_priority time is 1
82. Dijkstra_List time is 1
83. Dijkstra_List_priority time is 1
84. Dijkstra_heap time is 1
85. SPFA time is 0
86. SPFA_List time is 1
87. Floyd time is 49
88. Bellman time is 105
89. The answer of SPFA is 1797
90. The answer of SPFA_List is 1797
91. The answer of Dijkstra is 1797
92. The answer of Dijkstra_priority is 1797
93. The answer of Dijkstra_List is 1797
94. The answer of Dijkstra_List_priority is 1797
95. The answer of Floyd is 1797
96. The answer of BellmanFord is 1797
97. The answer of Dijkstra_Heap is 1797
98. _________________________________________________
99. Dijkstra time is 1
100. Dijkstra_priority time is 1
101. Dijkstra_List time is 1
102. Dijkstra_List_priority time is 1
103. Dijkstra_heap time is 0
104. SPFA time is 1
105. SPFA_List time is 1
106. Floyd time is 51
107. Bellman time is 113
108. The answer of SPFA is 1358
109. The answer of SPFA_List is 1358
110. The answer of Dijkstra is 1358
111. The answer of Dijkstra_priority is 1358
112. The answer of Dijkstra_List is 1358
113. The answer of Dijkstra_List_priority is 1358
114. The answer of Floyd is 1358
115. The answer of BellmanFord is 1358
116. The answer of Dijkstra_Heap is 1358
117. _________________________________________________
118. Dijkstra time is 0
119. Dijkstra_priority time is 1
120. Dijkstra_List time is 1
121. Dijkstra_List_priority time is 1
122. Dijkstra_heap time is 1
123. SPFA time is 1
124. SPFA_List time is 0
125. Floyd time is 50
126. Bellman time is 203
127. The answer of SPFA is 1633
128. The answer of SPFA_List is 1633
129. The answer of Dijkstra is 1633
130. The answer of Dijkstra_priority is 1633
131. The answer of Dijkstra_List is 1633
132. The answer of Dijkstra_List_priority is 1633
133. The answer of Floyd is 1633
134. The answer of BellmanFord is 1633
135. The answer of Dijkstra_Heap is 1633
136. _________________________________________________
137. n = 200;******************************************
138. Dijkstra time is 1
139. Dijkstra_priority time is 2
140. Dijkstra_List time is 1
141. Dijkstra_List_priority time is 2
142. Dijkstra_heap time is 1
143. SPFA time is 1
144. SPFA_List time is 1
145. Floyd time is 234
146. Bellman time is 279
147. The answer of SPFA is 382
148. The answer of SPFA_List is 382
149. The answer of Dijkstra is 382
150. The answer of Dijkstra_priority is 382
151. The answer of Dijkstra_List is 382
152. The answer of Dijkstra_List_priority is 382
153. The answer of Floyd is 382
154. The answer of BellmanFord is 382
155. The answer of Dijkstra_Heap is 382
156. _________________________________________________
157. Dijkstra time is 1
158. Dijkstra_priority time is 2
159. Dijkstra_List time is 1
160. Dijkstra_List_priority time is 2
161. Dijkstra_heap time is 0
162. SPFA time is 1
163. SPFA_List time is 1
164. Floyd time is 119
165. Bellman time is 256
166. The answer of SPFA is 970
167. The answer of SPFA_List is 970
168. The answer of Dijkstra is 970
169. The answer of Dijkstra_priority is 970
170. The answer of Dijkstra_List is 970
171. The answer of Dijkstra_List_priority is 970
172. The answer of Floyd is 970
173. The answer of BellmanFord is 970
174. The answer of Dijkstra_Heap is 970
175. _________________________________________________
176. Dijkstra time is 0
177. Dijkstra_priority time is 1
178. Dijkstra_List time is 0
179. Dijkstra_List_priority time is 3
180. Dijkstra_heap time is 0
181. SPFA time is 1
182. SPFA_List time is 1
183. Floyd time is 122
184. Bellman time is 250
185. The answer of SPFA is 407
186. The answer of SPFA_List is 407
187. The answer of Dijkstra is 407
188. The answer of Dijkstra_priority is 407
189. The answer of Dijkstra_List is 407
190. The answer of Dijkstra_List_priority is 407
191. The answer of Floyd is 407
192. The answer of BellmanFord is 407
193. The answer of Dijkstra_Heap is 407
194. _________________________________________________
195. n = 300;******************************************
196. Dijkstra time is 1
197. Dijkstra_priority time is 2
198. Dijkstra_List time is 2
199. Dijkstra_List_priority time is 4
200. Dijkstra_heap time is 2
201. SPFA time is 3
202. SPFA_List time is 3
203. Floyd time is 394
204. Bellman time is 1066
205. The answer of SPFA is 543
206. The answer of SPFA_List is 543
207. The answer of Dijkstra is 543
208. The answer of Dijkstra_priority is 543
209. The answer of Dijkstra_List is 543
210. The answer of Dijkstra_List_priority is 543
211. The answer of Floyd is 543
212. The answer of BellmanFord is 543
213. The answer of Dijkstra_Heap is 543
214. _________________________________________________
215. Dijkstra time is 2
216. Dijkstra_priority time is 4
217. Dijkstra_List time is 2
218. Dijkstra_List_priority time is 4
219. Dijkstra_heap time is 1
220. SPFA time is 2
221. SPFA_List time is 3
222. Floyd time is 542
223. Bellman time is 1081
224. The answer of SPFA is 628
225. The answer of SPFA_List is 628
226. The answer of Dijkstra is 628
227. The answer of Dijkstra_priority is 628
228. The answer of Dijkstra_List is 628
229. The answer of Dijkstra_List_priority is 628
230. The answer of Floyd is 628
231. The answer of BellmanFord is 628
232. The answer of Dijkstra_Heap is 628
233. _________________________________________________
234. Dijkstra time is 2
235. Dijkstra_priority time is 3
236. Dijkstra_List time is 3
237. Dijkstra_List_priority time is 4
238. Dijkstra_heap time is 2
239. SPFA time is 2
240. SPFA_List time is 3
241. Floyd time is 439
242. Bellman time is 1009
243. The answer of SPFA is 1000
244. The answer of SPFA_List is 1000
245. The answer of Dijkstra is 1000
246. The answer of Dijkstra_priority is 1000
247. The answer of Dijkstra_List is 1000
248. The answer of Dijkstra_List_priority is 1000
249. The answer of Floyd is 1000
250. The answer of BellmanFord is 1000
251. The answer of Dijkstra_Heap is 1000
252. _________________________________________________
253. n = 500;******************************************
254. Dijkstra time is 5
255. Dijkstra_priority time is 7
256. Dijkstra_List time is 6
257. Dijkstra_List_priority time is 11
258. Dijkstra_heap time is 4
259. SPFA time is 9
260. SPFA_List time is 10
261. Floyd time is 3098
262. Bellman time is 5135
263. The answer of SPFA is 618
264. The answer of SPFA_List is 618
265. The answer of Dijkstra is 618
266. The answer of Dijkstra_priority is 618
267. The answer of Dijkstra_List is 618
268. The answer of Dijkstra_List_priority is 618
269. The answer of Floyd is 618
270. The answer of BellmanFord is 618
271. The answer of Dijkstra_Heap is 618
272. _________________________________________________
273. Dijkstra time is 7
274. Dijkstra_priority time is 8
275. Dijkstra_List time is 7
276. Dijkstra_List_priority time is 12
277. Dijkstra_heap time is 5
278. SPFA time is 10
279. SPFA_List time is 12
280. Floyd time is 2625
281. Bellman time is 5268
282. The answer of SPFA is 496
283. The answer of SPFA_List is 496
284. The answer of Dijkstra is 496
285. The answer of Dijkstra_priority is 496
286. The answer of Dijkstra_List is 496
287. The answer of Dijkstra_List_priority is 496
288. The answer of Floyd is 496
289. The answer of BellmanFord is 496
290. The answer of Dijkstra_Heap is 496
291. _________________________________________________
292. Dijkstra time is 5
293. Dijkstra_priority time is 6
294. Dijkstra_List time is 8
295. Dijkstra_List_priority time is 12
296. Dijkstra_heap time is 5
297. SPFA time is 9
298. SPFA_List time is 13
299. Floyd time is 2784
300. Bellman time is 5328
301. The answer of SPFA is 348
302. The answer of SPFA_List is 348
303. The answer of Dijkstra is 348
304. The answer of Dijkstra_priority is 348
305. The answer of Dijkstra_List is 348
306. The answer of Dijkstra_List_priority is 348
307. The answer of Floyd is 348
308. The answer of BellmanFord is 348
309. The answer of Dijkstra_Heap is 348
310. _________________________________________________
311. n = 750;******************************************
312. Dijkstra time is 11
313. Dijkstra_priority time is 12
314. Dijkstra_List time is 80
315. Dijkstra_List_priority time is 19
316. Dijkstra_heap time is 8
317. SPFA time is 18
318. SPFA_List time is 23
319. Floyd time is 8399
320. Bellman time is 15542
321. The answer of SPFA is 320
322. The answer of SPFA_List is 320
323. The answer of Dijkstra is 320
324. The answer of Dijkstra_priority is 320
325. The answer of Dijkstra_List is 320
326. The answer of Dijkstra_List_priority is 320
327. The answer of Floyd is 320
328. The answer of BellmanFord is 320
329. The answer of Dijkstra_Heap is 320
330. _________________________________________________
331. Dijkstra time is 13
332. Dijkstra_priority time is 14
333. Dijkstra_List time is 89
334. Dijkstra_List_priority time is 22
335. Dijkstra_heap time is 12
336. SPFA time is 22
337. SPFA_List time is 32
338. Floyd time is 8316
339. Bellman time is 14367
340. The answer of SPFA is 252
341. The answer of SPFA_List is 252
342. The answer of Dijkstra is 252
343. The answer of Dijkstra_priority is 252
344. The answer of Dijkstra_List is 252
345. The answer of Dijkstra_List_priority is 252
346. The answer of Floyd is 252
347. The answer of BellmanFord is 252
348. The answer of Dijkstra_Heap is 252
349. _________________________________________________
350. Dijkstra time is 13
351. Dijkstra_priority time is 13
352. Dijkstra_List time is 13
353. Dijkstra_List_priority time is 20
354. Dijkstra_heap time is 10
355. SPFA time is 21
356. SPFA_List time is 22
357. Floyd time is 8072
358. Bellman time is 14145
359. The answer of SPFA is 443
360. The answer of SPFA_List is 443
361. The answer of Dijkstra is 443
362. The answer of Dijkstra_priority is 443
363. The answer of Dijkstra_List is 443
364. The answer of Dijkstra_List_priority is 443
365. The answer of Floyd is 443
366. The answer of BellmanFord is 443
367. The answer of Dijkstra_Heap is 443
368. _________________________________________________
369. n = 1000;******************************************
370. Dijkstra time is 24
371. Dijkstra_priority time is 21
372. Dijkstra_List time is 26
373. Dijkstra_List_priority time is 38
374. Dijkstra_heap time is 16
375. SPFA time is 32
376. SPFA_List time is 53
377. Floyd time is 14839
378. Bellman time is 30615
379. The answer of SPFA is 230
380. The answer of SPFA_List is 230
381. The answer of Dijkstra is 230
382. The answer of Dijkstra_priority is 230
383. The answer of Dijkstra_List is 230
384. The answer of Dijkstra_List_priority is 230
385. The answer of Floyd is 230
386. The answer of BellmanFord is 230
387. The answer of Dijkstra_Heap is 230
388. _________________________________________________
389. Dijkstra time is 22
390. Dijkstra_priority time is 25
391. Dijkstra_List time is 27
392. Dijkstra_List_priority time is 46
393. Dijkstra_heap time is 15
394. SPFA time is 41
395. SPFA_List time is 56
396. Floyd time is 14106
397. Bellman time is 28779
398. The answer of SPFA is 275
399. The answer of SPFA_List is 275
400. The answer of Dijkstra is 275
401. The answer of Dijkstra_priority is 275
402. The answer of Dijkstra_List is 275
403. The answer of Dijkstra_List_priority is 275
404. The answer of Floyd is 275
405. The answer of BellmanFord is 275
406. The answer of Dijkstra_Heap is 275
407. _________________________________________________
408. Dijkstra time is 29
409. Dijkstra_priority time is 22
410. Dijkstra_List time is 24
411. Dijkstra_List_priority time is 35
412. Dijkstra_heap time is 22
413. SPFA time is 31
414. SPFA_List time is 61
415. Floyd time is 13779
416. Bellman time is 28682
417. The answer of SPFA is 280
418. The answer of SPFA_List is 280
419. The answer of Dijkstra is 280
420. The answer of Dijkstra_priority is 280
421. The answer of Dijkstra_List is 280
422. The answer of Dijkstra_List_priority is 280
423. The answer of Floyd is 280
424. The answer of BellmanFord is 280
425. The answer of Dijkstra_Heap is 280
426. _________________________________________________
427. n = 1250*******************************************
428. Dijkstra time is 97
429. Dijkstra_priority time is 31
430. Dijkstra_List time is 39
431. Dijkstra_List_priority time is 48
432. Dijkstra_heap time is 24
433. SPFA time is 54
434. SPFA_List time is 72
435. Floyd time is 25924
436. Bellman time is 55248
437. The answer of SPFA is 185
438. The answer of SPFA_List is 185
439. The answer of Dijkstra is 185
440. The answer of Dijkstra_priority is 185
441. The answer of Dijkstra_List is 185
442. The answer of Dijkstra_List_priority is 185
443. The answer of Floyd is 185
444. The answer of BellmanFord is 185
445. The answer of Dijkstra_Heap is 185
446. _________________________________________________
447. Dijkstra time is 35
448. Dijkstra_priority time is 34
449. Dijkstra_List time is 62
450. Dijkstra_List_priority time is 59
451. Dijkstra_heap time is 24
452. SPFA time is 63
453. SPFA_List time is 77
454. Floyd time is 25744
455. Bellman time is 56472
456. The answer of SPFA is 129
457. The answer of SPFA_List is 129
458. The answer of Dijkstra is 129
459. The answer of Dijkstra_priority is 129
460. The answer of Dijkstra_List is 129
461. The answer of Dijkstra_List_priority is 129
462. The answer of Floyd is 129
463. The answer of BellmanFord is 129
464. The answer of Dijkstra_Heap is 129
465. _________________________________________________
466. Dijkstra time is 47
467. Dijkstra_priority time is 30
468. Dijkstra_List time is 42
469. Dijkstra_List_priority time is 68
470. Dijkstra_heap time is 43
471. SPFA time is 72
472. SPFA_List time is 86
473. Floyd time is 25993
474. Bellman time is 56552
475. The answer of SPFA is 188
476. The answer of SPFA_List is 188
477. The answer of Dijkstra is 188
478. The answer of Dijkstra_priority is 188
479. The answer of Dijkstra_List is 188
480. The answer of Dijkstra_List_priority is 188
481. The answer of Floyd is 188
482. The answer of BellmanFord is 188
483. The answer of Dijkstra_Heap is 188
稀疏图
[cpp] view plain copy
1. n = 500; m = 1000;*************************************
2. Dijkstra time is 3
3. Dijkstra_priority time is 0
4. Dijkstra_List time is 3
5. Dijkstra_List_priority time is 2
6. Dijkstra_heap time is 0
7. SPFA time is 0
8. SPFA_List time is 0
9. Bellman time is 18
10. The answer of SPFA is 139408
11. The answer of SPFA_List is 139408
12. The answer of Dijkstra is 139408
13. The answer of Dijkstra_priority is 139408
14. The answer of Dijkstra_List is 139408
15. The answer of Dijkstra_List_priority is 139408
16. The answer of BellmanFord is 139408
17. The answer of Dijkstra_Heap is 139408
18. _________________________________________________
19. n = 500; m = 5000;
20. Dijkstra time is 5
21. Dijkstra_priority time is 2
22. Dijkstra_List time is 3
23. Dijkstra_List_priority time is 2
24. Dijkstra_heap time is 0
25. SPFA time is 3
26. SPFA_List time is 2
27. Bellman time is 85
28. The answer of SPFA is 18603
29. The answer of SPFA_List is 18603
30. The answer of Dijkstra is 18603
31. The answer of Dijkstra_priority is 18603
32. The answer of Dijkstra_List is 18603
33. The answer of Dijkstra_List_priority is 18603
34. The answer of BellmanFord is 18603
35. The answer of Dijkstra_Heap is 18603
36. _________________________________________________
37. n = 500; m = 10000;
38. Dijkstra time is 2
39. Dijkstra_priority time is 5
40. Dijkstra_List time is 3
41. Dijkstra_List_priority time is 2
42. Dijkstra_heap time is 0
43. SPFA time is 3
44. SPFA_List time is 2
45. Bellman time is 153
46. The answer of SPFA is 7388
47. The answer of SPFA_List is 7388
48. The answer of Dijkstra is 7388
49. The answer of Dijkstra_priority is 7388
50. The answer of Dijkstra_List is 7388
51. The answer of Dijkstra_List_priority is 7388
52. The answer of BellmanFord is 7388
53. The answer of Dijkstra_Heap is 7388
54. _________________________________________________
55. Dijkstra time is 5
56. Dijkstra_priority time is 5
57. Dijkstra_List time is 3
58. Dijkstra_List_priority time is 2
59. Dijkstra_heap time is 0
60. SPFA time is 3
61. SPFA_List time is 2
62. Bellman time is 180
63. The answer of SPFA is 13578
64. The answer of SPFA_List is 13578
65. The answer of Dijkstra is 13578
66. The answer of Dijkstra_priority is 13578
67. The answer of Dijkstra_List is 13578
68. The answer of Dijkstra_List_priority is 13578
69. The answer of BellmanFord is 13578
70. The answer of Dijkstra_Heap is 13578
71. _________________________________________________
72. n = 500; m = 50000;
73. Dijkstra time is 7
74. Dijkstra_priority time is 5
75. Dijkstra_List time is 3
76. Dijkstra_List_priority time is 5
77. Dijkstra_heap time is 2
78. SPFA time is 8
79. SPFA_List time is 5
80. Bellman time is 1023
81. The answer of SPFA is 2771
82. The answer of SPFA_List is 2771
83. The answer of Dijkstra is 2771
84. The answer of Dijkstra_priority is 2771
85. The answer of Dijkstra_List is 2771
86. The answer of Dijkstra_List_priority is 2771
87. The answer of BellmanFord is 2771
88. The answer of Dijkstra_Heap is 2771
89. _________________________________________________
90. Dijkstra time is 5
91. Dijkstra_priority time is 5
92. Dijkstra_List time is 5
93. Dijkstra_List_priority time is 5
94. Dijkstra_heap time is 0
95. SPFA time is 7
96. SPFA_List time is 5
97. Bellman time is 828
98. The answer of SPFA is 2642
99. The answer of SPFA_List is 2642
100. The answer of Dijkstra is 2642
101. The answer of Dijkstra_priority is 2642
102. The answer of Dijkstra_List is 2642
103. The answer of Dijkstra_List_priority is 2642
104. The answer of BellmanFord is 2642
105. The answer of Dijkstra_Heap is 2642
106. _________________________________________________
107. n = 500; m = 100000;
108. Dijkstra time is 5
109. Dijkstra_priority time is 5
110. Dijkstra_List time is 25
111. Dijkstra_List_priority time is 15
112. Dijkstra_heap time is 5
113. SPFA time is 10
114. SPFA_List time is 15
115. Bellman time is 1678
116. The answer of SPFA is 1126
117. The answer of SPFA_List is 1126
118. The answer of Dijkstra is 1126
119. The answer of Dijkstra_priority is 1126
120. The answer of Dijkstra_List is 1126
121. The answer of Dijkstra_List_priority is 1126
122. The answer of BellmanFord is 1126
123. The answer of Dijkstra_Heap is 1126
124. _________________________________________________
125. Dijkstra time is 5
126. Dijkstra_priority time is 8
127. Dijkstra_List time is 5
128. Dijkstra_List_priority time is 10
129. Dijkstra_heap time is 10
130. SPFA time is 10
131. SPFA_List time is 27
132. Bellman time is 1543
133. The answer of SPFA is 717
134. The answer of SPFA_List is 717
135. The answer of Dijkstra is 717
136. The answer of Dijkstra_priority is 717
137. The answer of Dijkstra_List is 717
138. The answer of Dijkstra_List_priority is 717
139. The answer of BellmanFord is 717
140. The answer of Dijkstra_Heap is 717
141. n = 500; m = 200000;
142. Dijkstra time is 7
143. Dijkstra_priority time is 8
144. Dijkstra_List time is 137
145. Dijkstra_List_priority time is 30
146. Dijkstra_heap time is 27
147. SPFA time is 13
148. SPFA_List time is 112
149. Bellman time is 2740
150. The answer of SPFA is 897
151. The answer of SPFA_List is 897
152. The answer of Dijkstra is 897
153. The answer of Dijkstra_priority is 897
154. The answer of Dijkstra_List is 897
155. The answer of Dijkstra_List_priority is 897
156. The answer of BellmanFord is 897
157. The answer of Dijkstra_Heap is 897
158. _________________________________________________
159. Dijkstra time is 8
160. Dijkstra_priority time is 7
161. Dijkstra_List time is 23
162. Dijkstra_List_priority time is 22
163. Dijkstra_heap time is 18
164. SPFA time is 12
165. SPFA_List time is 57
166. Bellman time is 3288
167. The answer of SPFA is 552
168. The answer of SPFA_List is 552
169. The answer of Dijkstra is 552
170. The answer of Dijkstra_priority is 552
171. The answer of Dijkstra_List is 552
172. The answer of Dijkstra_List_priority is 552
173. The answer of BellmanFord is 552
174. The answer of Dijkstra_Heap is 552
175. _________________________________________________
176. n = 1000; m = 10000;
177. Dijkstra time is 18
178. Dijkstra_priority time is 10
179. Dijkstra_List time is 15
180. Dijkstra_List_priority time is 5
181. Dijkstra_heap time is 2
182. SPFA time is 20
183. SPFA_List time is 0
184. Bellman time is 310
185. The answer of SPFA is 22265
186. The answer of SPFA_List is 22265
187. The answer of Dijkstra is 22265
188. The answer of Dijkstra_priority is 22265
189. The answer of Dijkstra_List is 22265
190. The answer of Dijkstra_List_priority is 22265
191. The answer of BellmanFord is 22265
192. The answer of Dijkstra_Heap is 22265
193. _________________________________________________
194. Dijkstra time is 17
195. Dijkstra_priority time is 20
196. Dijkstra_List time is 10
197. Dijkstra_List_priority time is 3
198. Dijkstra_heap time is 2
199. SPFA time is 10
200. SPFA_List time is 0
201. Bellman time is 400
202. The answer of SPFA is 25732
203. The answer of SPFA_List is 25732
204. The answer of Dijkstra is 25732
205. The answer of Dijkstra_priority is 25732
206. The answer of Dijkstra_List is 25732
207. The answer of Dijkstra_List_priority is 25732
208. The answer of BellmanFord is 25732
209. The answer of Dijkstra_Heap is 25732
210. _________________________________________________
211. n = 1000; m = 100000;
212. Dijkstra time is 18
213. Dijkstra_priority time is 12
214. Dijkstra_List time is 18
215. Dijkstra_List_priority time is 12
216. Dijkstra_heap time is 8
217. SPFA time is 25
218. SPFA_List time is 18
219. Bellman time is 3302
220. The answer of SPFA is 2350
221. The answer of SPFA_List is 2350
222. The answer of Dijkstra is 2350
223. The answer of Dijkstra_priority is 2350
224. The answer of Dijkstra_List is 2350
225. The answer of Dijkstra_List_priority is 2350
226. The answer of BellmanFord is 2350
227. The answer of Dijkstra_Heap is 2350
228. _________________________________________________
229. Dijkstra time is 17
230. Dijkstra_priority time is 13
231. Dijkstra_List time is 17
232. Dijkstra_List_priority time is 15
233. Dijkstra_heap time is 5
234. SPFA time is 25
235. SPFA_List time is 50
236. Bellman time is 3213
237. The answer of SPFA is 2706
238. The answer of SPFA_List is 2706
239. The answer of Dijkstra is 2706
240. The answer of Dijkstra_priority is 2706
241. The answer of Dijkstra_List is 2706
242. The answer of Dijkstra_List_priority is 2706
243. The answer of BellmanFord is 2706
244. The answer of Dijkstra_Heap is 2706
245. _________________________________________________
246. n = 1000; m = 500000;
247. Dijkstra time is 32
248. Dijkstra_priority time is 20
249. Dijkstra_List time is 120
250. Dijkstra_List_priority time is 155
251. Dijkstra_heap time is 65
252. SPFA time is 60
253. SPFA_List time is 387
254. Bellman time is 12755
255. The answer of SPFA is 545
256. The answer of SPFA_List is 545
257. The answer of Dijkstra is 545
258. The answer of Dijkstra_priority is 545
259. The answer of Dijkstra_List is 545
260. The answer of Dijkstra_List_priority is 545
261. The answer of BellmanFord is 545
262. The answer of Dijkstra_Heap is 545
263. _________________________________________________
264. Dijkstra time is 32
265. Dijkstra_priority time is 35
266. Dijkstra_List time is 100
267. Dijkstra_List_priority time is 340
268. Dijkstra_heap time is 185
269. SPFA time is 95
270. SPFA_List time is 265
271. Bellman time is 12843
272. The answer of SPFA is 665
273. The answer of SPFA_List is 665
274. The answer of Dijkstra is 665
275. The answer of Dijkstra_priority is 665
276. The answer of Dijkstra_List is 665
277. The answer of Dijkstra_List_priority is 665
278. The answer of BellmanFord is 665
279. The answer of Dijkstra_Heap is 665
280. _________________________________________________
281. n = 3000; m = 10000
282. Dijkstra_List time is 100
283. Dijkstra_List_priority time is 5
284. Dijkstra_heap time is 3
285. SPFA_List time is 2
286. The answer of SPFA_List is 124335
287. The answer of Dijkstra_List is 124335
288. The answer of Dijkstra_List_priority is 124335
289. The answer of Dijkstra_Heap is 124335
290. _________________________________________________
291. n = 3000; m = 100000;
292. Dijkstra_List time is 110
293. Dijkstra_List_priority time is 27
294. Dijkstra_heap time is 8
295. SPFA_List time is 20
296. The answer of SPFA_List is 9309
297. The answer of Dijkstra_List is 9309
298. The answer of Dijkstra_List_priority is 9309
299. The answer of Dijkstra_Heap is 9309
300. _________________________________________________
301. n = 3000; m = 500000;
302. Dijkstra_List time is 205
303. Dijkstra_List_priority time is 140
304. Dijkstra_heap time is 125
305. SPFA_List time is 468
306. The answer of SPFA_List is 1880
307. The answer of Dijkstra_List is 1880
308. The answer of Dijkstra_List_priority is 1880
309. The answer of Dijkstra_Heap is 1880
310. _________________________________________________
311. n = 3000; m = 1000000;
312. Dijkstra_List time is 373
313. Dijkstra_List_priority time is 340
314. Dijkstra_heap time is 265
315. SPFA_List time is 780
316. The answer of SPFA_List is 902
317. The answer of Dijkstra_List is 902
318. The answer of Dijkstra_List_priority is 902
319. The answer of Dijkstra_Heap is 902
320. _________________________________________________
321. n = 10000; m = 100000;
322. Dijkstra_List time is 1445
323. Dijkstra_List_priority time is 43
324. Dijkstra_heap time is 22
325. SPFA_List time is 50
326. The answer of SPFA_List is 22591
327. The answer of Dijkstra_List is 22591
328. The answer of Dijkstra_List_priority is 22591
329. The answer of Dijkstra_Heap is 22591
330. _________________________________________________
331. n = 10000; m = 500000;
332. Dijkstra_List time is 1453
333. Dijkstra_List_priority time is 192
334. Dijkstra_heap time is 200
335. SPFA_List time is 220
336. The answer of SPFA_List is 5972
337. The answer of Dijkstra_List is 5972
338. The answer of Dijkstra_List_priority is 5972
339. The answer of Dijkstra_Heap is 5972
340. _________________________________________________
341. n = 10000; m = 1000000;
342. Dijkstra_List time is 1430
343. Dijkstra_List_priority time is 320
344. Dijkstra_heap time is 308
345. SPFA_List time is 645
346. The answer of SPFA_List is 3686
347. The answer of Dijkstra_List is 3686
348. The answer of Dijkstra_List_priority is 3686
349. The answer of Dijkstra_Heap is 3686
350. _________________________________________________
351. n = 30000; m = 100000;
352. Dijkstra_List_priority time is 145
353. Dijkstra_heap time is 78
354. SPFA_List time is 73
355. The answer of SPFA_List is 91079
356. The answer of Dijkstra_List_priority is 91079
357. The answer of Dijkstra_Heap is 91079
358. _________________________________________________
359. n = 30000; m = 1000000;
360. Dijkstra_List_priority time is 625
361. Dijkstra_heap time is 453
362. SPFA_List time is 1057
363. The answer of SPFA_List is 10881
364. The answer of Dijkstra_List_priority is 10881
365. The answer of Dijkstra_Heap is 10881
366. _________________________________________________
367. n = 30000; m = 3000000;
368. Dijkstra_List_priority time is 963
369. Dijkstra_heap time is 940
370. SPFA_List time is 1762
371. The answer of SPFA_List is 2606
372. The answer of Dijkstra_List_priority is 2606
373. The answer of Dijkstra_Heap is 2606
374. _________________________________________________
相关阅读:
一线架构师实践指南读后感
 可修改性战术
 软件架构师如何工作？
寒假学习第十五天
 寒假学习第十四天
 寒假学习第十三天
 寒假学习第十二天
 寒假学习第十一天
 寒假学习第十天
 如何变得聪明
原文地址：https://www.cnblogs.com/Jadon97/p/6618671.html

最新文章
django-视图层
 django-路由层
 django框架的基本使用
 django框架入门
 三大web框架
 引入web框架以及优化过程
 ToB和ToC介绍
 Bootstarp框架
 jQuery
word2vec学习