圆排列问题的研究.docVIP

圆排列问题的研究 摘要 回溯法（探索与回溯法）是一种选优搜索法，按选优条件向前搜索，以达到目标。但当探索到某一步时，发现原先选择并不优或达不到目标，就退回一步重新选择，这种走不通就退回再走的技术为回溯法，而满足回溯条件的某个状态的点称为“回溯点”。 圆排列描述的是在给定n个大小不等的圆 C1,C2,…,Cn,现要将这n个圆排进一个矩形框中，且要求各圆与矩形框的底边相切。圆排列问题要求从n个圆的所有排列中找出有最小长度的圆排列。 本次课程设计中对于给定的n个圆，设计一个回溯法，通过C++语言编程，实现计算n个圆的最佳排列方案，使其长度达到最小。 关键词：圆排列；回溯法；C++;  STUDIES ARE ARRANGED ROUND THE PROBLEM ABSTRACT Backtracking (exploration and backtracking) is an optimal selection search, search forward by optimal selection conditions in order to achieve the goal. But when exploring a step to find the original choice is not excellent or reach goal, a step back to re-select this dead returned to walk on technology as backtracking, but at some point the state to meet the conditions of backtracking called backward point.Circular arrangement described in the given n circles of varying sizes C1, C2, ..., Cn, n now give this round discharged into a rectangular box, and requires each circle is tangent to the bottom edge of the rectangle. Circular permutation problem requires to find out from all the permutations of n circles arranged in a round minimum length.The curriculum design in n for a given round, the design of a backtracking through the C + + language programming, to calculate the best arrangement of the n-th round program, its length to a minimum. Key words: circular arrangement; backtracking; C + +;  目 录 1 绪论……………………..………………………………………………………………….1 1.1 课题背景及目的………………………………………………………………………1 1.2 课题研究方法…………………………………………………………………………1 1.2.1基本内容………………………………………………………………………1 1.2.2基本概念………………………………………………………………………2 1.2.3算法设计………………………………………………………………………2 2 回溯法的介绍……………………………………………………………………………...4 2.1 回溯法的概念 …………..…………………………………………………………. .4 2.1.1 基本思想………………………………………………...…………………….4 2.1.2 一般表达 …………………………….……………………………………… 4 2.1.3 规律 ……………………………….…………………………………………4 2.1.4 空间树 ……………………………….……………………………………… 5 2.2 回溯法的算法思想……………………………………….………………………..5 2.2.1回溯法的一般步骤……………………………………………………….…...5 2.2.2 回溯法C语言举例……………………………………………………....…6