回複：誰能用圖論來解這道題？ 懇請牛人出著。

來源: aisanguo 於 2010-04-13 15:44:53 [] [博客] [舊帖] [給我悄悄話] 閱讀數 : (187 bytes)
本帖於 2010-04-15 10:02:55 時間, 由版主 於德利 編輯

your idea would reduce this problem to counting the number of distinct Hamiltonian paths in a undirected graph. Such a problem is generally hard (Hamiltonian path problem is NP-complete).

所有跟帖： 

• You're right.If don't think about first and last Nbs.Erler paths -jinjing- ♀ 給 jinjing 發送悄悄話 (98 bytes) () 04/13/2010 postreply 18:52:23

請您先登陸，再發跟帖！