問題詳情
18. Consider the below C code fragment, where MAXV, MAXDEG and MAXINT are properly defined constant positive integers.
【題組】(52) What can the procedure mystery() find ?
(A) shortest path tree
(B) all pairs of shortest paths
(C) minimum cut
(D) minimum spanning tree
(E) a maximum matching.
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增