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

來源: 於 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).