[理工] [資結]-政大98
8. Which of the following is FALSE concerning a graph with v vertices
and e edges?
(B) There exist algorithms in which finding the shortest path from the
source to another vertex is any faster (by more than a constant factor)
than finding the shortest paths from the source to all the other
vertices
(D) It is possible to depth first traversal a graph in linear time
我用刪去法大概知道(B)是錯的,不知道為什麼?
(D)是對的，因為用adajacency list表示是O(V+E)嗎?
PART III
2.(1) 洪x解答的array[13]應該是75，不是空的吧?
感謝!!
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 219.84.63.154
推
03/04 15:03, , 1F
03/04 15:03, 1F
→
03/04 15:14, , 2F
03/04 15:14, 2F
推
03/04 15:24, , 3F
03/04 15:24, 3F
→
03/04 15:25, , 4F
03/04 15:25, 4F
推
03/04 15:49, , 5F
03/04 15:49, 5F
→
03/04 15:50, , 6F
03/04 15:50, 6F
推
03/04 15:50, , 7F
03/04 15:50, 7F
推
03/04 15:51, , 8F
03/04 15:51, 8F
→
03/04 15:53, , 9F
03/04 15:53, 9F
→
03/04 15:53, , 10F
03/04 15:53, 10F
推
03/04 16:06, , 11F
03/04 16:06, 11F
推
03/04 16:19, , 12F
03/04 16:19, 12F
推
03/05 07:53, , 13F
03/05 07:53, 13F
※ 編輯: stevenwin 來自: 219.85.159.52 (03/06 16:49)