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

答案：登入後查看
統計： 尚無統計資料

詳解 (共 1 筆)

#7105831
1. 題目解析 題目要求我們計算有向圖...
(共 822 字，隱藏中）
前往觀看
0
0