回复：谁能用图论来解这道题？ 恳请牛人出着。

来源: 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

请您先登陆，再发跟帖！