問題詳情

7. Given an adjacency-list representation of a directed graph G = (V, E, w), it takes O(V) time to compute the in-degree ofevery vertex.
(A)O
(B)X

參考答案

答案:[無官方正解]
難度:計算中-1
書單:沒有書單,新增