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 筆)
未解鎖
1. 題目解析 題目要求選擇一個使用動...
阿摩線上測驗
登入
