問題詳情
19. Let G be a graph represented using adjacency matrix with n vertices and m cdges. What is the tightest upper bound onthe running time of depth-first search (DFS) on this graph?
(A) 0(n)
(B) 0(m+n)
(C) 0(n2)
(D) 0(mn)
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增