試題詳解

20. Which one of the following statement about shortest path problem is INCORRECT?
(A) Dijkstra's algorithm solves the single-source shortest path problem with both non-negative and negative edge weights.
(B) Bellman–Ford algorithm solves the single-source problem with possible negative edge weights.
(C) The shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.
(D) The shortest path problem can be defined for undirected, directed, or mixed graphs.
(E) None of the above.