問題詳情
31. Which of the following algorithm employs dynamic programming?
(A)Prim's algorithm for finding a minimum spanning tree
(B) Dijksta algorithm for solving the single source shortest paths problem
(C) Floyd-Warshall for solving the all pair shortest paths problem
(D)Hufiman algorithm for constructing a Hufiman code
(E) Kruskal's algorithm for finding a minimum spanning tree
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增