卷別

資料結構與演算法

選擇

國立臺灣大學 2023 · 考試 · 第 12 題

(5 points) Properties of shortest path problem: Which of the following statements is/are correct?

(A)
Dijkstra's algorithm can be applied to any directed graph with no negative cycle.
(B)
The heap data structure is likely to be used in Dijkstra's algorithm.
(C)
Floyd-Warshall algorithm can be applied to any directed graph with negative weights.
(D)
Floyd-Warshall algorithm is based on the concept of dynamic programming.
(E)
Every shortest path in a weighted directed graph $G$ will not change if an extra weight is added on every edge of $G$ .

標準解析

AI 已複查