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

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