11. 請問下列哪種演算法可以解決圖中所有點對最短路徑問題(all pair shortest path problem)?
(A) Bellme- Ford Algorithm
(B) Dijkstra Algorithm
(C) Floyed-Warshall Algorithm
(D) Prim Algorithm
答案:登入後查看
統計: A(3), B(21), C(25), D(2), E(0) #3223160
統計: A(3), B(21), C(25), D(2), E(0) #3223160