Request node 0 as the beginning and end of the path, the existing three, four, five of the three nodes, permutation and combination produces after six paths 0-3-4-5-0, 0-3-4-5-0, 0-4-3-5-0, 0-4-3-5-0, 0-5-3-4-0, 0-5-3-4-0.
But after the three path with the previous three path is symmetrical, to reduce the path size convenient follow-up calculation to avoid when produce path after three paths, excuse me what method can be used? View in the literature with the use of "neighbor algorithm", but somehow, the specific implementation, is a great god can give directions, or use other algorithm, (late will have a large number of nodes, can produce infinite path of exponential, so want to adopt algorithm reduced the scale of the problem)