問題詳情
16. Consider the graph in the previous problem. Let dist(i, j) be the length of the shortest path from node i tonode j. What is dist(A,F)+dist(B,F) +dist(C,F)+dist(D,F)+dist(E,F)?
(A)7
(B)8
(C)9
(D)10
(E) none of the above
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增