[理工] [資結]-成大97-資工所
請教一下第二大題第5小題的答案是?
題目如下
Consider the following two problems in which we are given a directed graph
G=(V,E) and vertices u,v belong to V
Unweighted shortest path problem
(Find a path from u to v consisting of the fewest edges)
Unweighted longest simple path problem
(Find a path from u to v consisting of the most edges)
(a)Determine which problem can be solved using dynamic programming
(b)Determine which problem cannot be solved using dynamic programming
a小題感覺可以用BFS
用DP兩題都沒有頭緒
麻煩幫解答 感謝^^
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.216.152.217
推
03/06 18:24, , 1F
03/06 18:24, 1F
→
03/06 18:24, , 2F
03/06 18:24, 2F
→
03/06 18:25, , 3F
03/06 18:25, 3F
→
03/06 18:26, , 4F
03/06 18:26, 4F
→
03/06 18:27, , 5F
03/06 18:27, 5F
推
03/06 22:45, , 6F
03/06 22:45, 6F
推
03/06 22:45, , 7F
03/06 22:45, 7F