圆排列问题（Circle permutation problem）.docVIP

圆排列问题（Circle permutation problem） Data worth having From the usual study, accumulation and summary Where there is a problem, there must be some Please also criticize and correct me! Circle permutation problem I. problem description Given the size of the circle N C1 C2 ... Now put the N circles in a rectangular box And ask the circle to be tangent to the bottom of the rectangle The circular permutation problem requires all rows from the N circles Two, algorithm design The solution space of the round permutation problem is a permutation tree Algorithm framework for searching permutation trees based on Backtracking Set a=[r1 at the start R2 ... Rn] is the radius of the given N circle The corresponding permutation tree is made up of all the permutations of a=[1:n] The backtracking algorithm for solving the permutation of a circle circlePerm (n A) returns the minimum circle length found Initial time The input a of the array N is the radius of the circle At the end of the calculation, the circle arrangement corresponding to the optimal solution is returned Center is used to calculate the abscissa of the center of the circle in the current arrangement of the currently selected circle Compute is used to calculate the length of the current circle arrangement The variable min is used to record the minimum length of the current round array; the array R represents the current circle arrangement; the array x records the central coordinate of the circles in the current round arrangement In the algorithm, the circle is arranged in the current round arrangement, and the abscissa of the first circle is 0 In recursive algorithms, bracktrack When I n Algorithm search to leaf node New round scheme is obtained At this point, the algorithm calls compute to calculate the length of the current circle Update the current best value in time When in The current extension node is in layer I-1 of the alignment tree At this point, the algorithm selects the next circle to be arranged And the corre