[理工] [資結]-DFS
The complexity for performing depth first search and breath first search on
a n-vertex undirected graph which is represented by an adjacency list is
O(n)
洪X解答說是false 所以答案為O(e+v),但是偉X說是O(n^2),網路上找說用list是O(2|v|)
那到底是哪一個= =?因為洪X的解答網路上的評價...所以每錯一題我就想問一下
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 220.138.105.159
→
02/25 19:36, , 1F
02/25 19:36, 1F
→
02/25 19:36, , 2F
02/25 19:36, 2F
推
02/25 19:38, , 3F
02/25 19:38, 3F
→
02/25 19:38, , 4F
02/25 19:38, 4F
→
02/25 19:44, , 5F
02/25 19:44, 5F
→
02/25 19:44, , 6F
02/25 19:44, 6F
→
02/25 19:47, , 7F
02/25 19:47, 7F
→
02/25 20:02, , 8F
02/25 20:02, 8F
→
02/25 22:01, , 9F
02/25 22:01, 9F
→
02/25 22:02, , 10F
02/25 22:02, 10F
推
02/25 22:22, , 11F
02/25 22:22, 11F
推
02/26 09:25, , 12F
02/26 09:25, 12F