問題詳情

15. Consider the given directed graph. Let dist(i, j)be the length of the shortest path from node i tonode j. What is dist(A,C)+dist(A,E)+dist(A,F)?


(A) 10
(B) 12
(C) 13
(D) 15
(E) None of the above.

參考答案

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