[理工] 資結-100政大
Which of the following data structure is the least likely to be used in
Dijkstra's shortest path algorithm?
(a) heap (b)queue (c)stack (d)hashing
答案是(a)
他的 Extract-min(Q)不是就是用heap維持的嗎@@?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.230.130.32
推
02/04 01:51, , 1F
02/04 01:51, 1F
→
02/04 01:52, , 2F
02/04 01:52, 2F
→
02/04 01:52, , 3F
02/04 01:52, 3F
→
02/04 01:53, , 4F
02/04 01:53, 4F
→
02/04 02:32, , 5F
02/04 02:32, 5F
→
02/04 02:33, , 6F
02/04 02:33, 6F
→
02/04 02:36, , 7F
02/04 02:36, 7F
→
02/04 02:38, , 8F
02/04 02:38, 8F
→
02/04 08:10, , 9F
02/04 08:10, 9F
→
02/04 09:26, , 10F
02/04 09:26, 10F
推
02/04 09:37, , 11F
02/04 09:37, 11F
→
02/04 09:38, , 12F
02/04 09:38, 12F
→
02/04 10:14, , 13F
02/04 10:14, 13F
→
02/04 11:20, , 14F
02/04 11:20, 14F
推
02/04 11:51, , 15F
02/04 11:51, 15F
推
02/04 11:55, , 16F
02/04 11:55, 16F
推
02/04 13:14, , 17F
02/04 13:14, 17F
推
02/04 15:43, , 18F
02/04 15:43, 18F
推
02/04 18:36, , 19F
02/04 18:36, 19F
→
02/04 23:17, , 20F
02/04 23:17, 20F
→
02/04 23:18, , 21F
02/04 23:18, 21F
→
02/04 23:18, , 22F
02/04 23:18, 22F
→
02/04 23:19, , 23F
02/04 23:19, 23F
推
02/05 00:32, , 24F
02/05 00:32, 24F
→
02/05 00:33, , 25F
02/05 00:33, 25F
→
02/05 00:33, , 26F
02/05 00:33, 26F
→
02/05 00:33, , 27F
02/05 00:33, 27F
→
02/05 00:35, , 28F
02/05 00:35, 28F
→
02/05 00:36, , 29F
02/05 00:36, 29F
推
02/05 01:45, , 30F
02/05 01:45, 30F
→
09/11 14:52, , 31F
09/11 14:52, 31F