問題詳情

( )21.Which of the following algorithms does not work for Graphs with negative weights?
(A) Bellman–Ford Algorithm
(B) Dijkstra’s Shortest Path Algorithm
(C) Floyd Warshall Algorithm
(D) None of the above.

參考答案

答案：B
難度：適中0.545
書單：沒有書單，新增