| 引用本文: | 刘继勇,陈庆华.生成n元数的全体排列的一个算法.[J].国防科技大学学报,1987,(4):93-97.[点击复制] |
| Liu Jiyong,Chen Qinghua.An Algorithm of the Generation of Complete N-permutation[J].Journal of National University of Defense Technology,1987,(4):93-97[点击复制] |
|
| |
|
|
| 本文已被：浏览 5397次 下载 5493次 |
| 生成n元数的全体排列的一个算法 |
| 刘继勇, 陈庆华 |
|
(系统工程与应用数学系)
|
| 摘要: |
| 许多组合问题可以表达为min?(q)，其中q 为1，2，…，n的任一排列[2]。关于排列生成的各种算法，文献[1]作了全面的介绍，并且进行了比较分析。本文从集合映射出发，得到了一个算法。在这个算法的基础上，对每个排列可以得到一个序号，对每个序号可以得到一个排列，并且可以从任一给定的排列开始生成全体排列。 |
| 关键词: 排列 映射 |
| DOI： |
| 投稿日期：1987-03-05 |
| 基金项目: |
|
| An Algorithm of the Generation of Complete N-permutation |
| Liu Jiyong, Chen Qinghua |
|
(Department of Applied Mathematics and System Engineering)
|
| Abstract: |
| Many problems are denoted by minf(q)，where q is any permutation of 1，2，…，n.
In conference [1]，every algorithm is presented in full and analysed comparatively. An algorithm is obtained by setting about set mapping in this paper. Based upon this algorithm，every permutation may produce an order number and vice versa，and Complete permutation can be generated from any permutation given. |
| Keywords: Permutation Mapping. |
|
|
