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

来源: 于 2010-04-13 15:44:53 [博客] [旧帖] [给我悄悄话] 本文已被阅读：次

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).