試題詳解

(53) If we change the statement (*) into "if (distance[w] ＞ (distance[v]+weight))}" and the statement (**) into "distance[w]=distance[v]+ weight；", then what can the procedure mystery() find ?
(A) shortest path tree
(B) all pairs of shortest paths
(C) minimum cut
(D) minimum spanning tree
(E) none of the above.