|
|||||
|
|
| 不相交集合的表示与基本操作的实现 | |
| 引用本文： | 胡新海. 不相交集合的表示与基本操作的实现[J]. 首都师范大学学报(自然科学版), 2013, 34(2): 4-7 |
| 作者姓名： | 胡新海 |
| 作者单位： | 陇南师范高等专科学校,甘肃成县,742500 |
| 摘 要： | 集合是数据的逻辑结构中最基本的一种类型,包含的数据元素之间各关系相对其他数据类型简单明了.对于多个集合交运算结果为空的不相交集合,可以通过不同的形式来表示它的存储结构.使用链表和森林的方式来表示不相交集合的存储结构,并在不同表示方式下对涉及到的一些基本操作进行分析讨论,有利于人们在实际应用中提高数据处理效率. |
| 关 键 词： | 不相交集合 表示与操作 时间复杂度 |
Representation and Basic Operation Realize of Disjoint Set |
|
| Hu Xinhai. Representation and Basic Operation Realize of Disjoint Set[J]. Journal of Capital Normal University(Natural Science Edition), 2013, 34(2): 4-7 | |
| Authors: | Hu Xinhai |
| Affiliation: | Hu Xinhai (Longnan Normal College, Chengxian Gansu 742500) |
| Abstract: | Set is the best basic type of data logical structure, the relationship between the data element that include in it simple and clear compare with other data type. For disjoint set that many set joint operate result is empty, that can use different form to show its storage structure. Storage structure use the method of list and forest to show disjoint set, and analysis and discuss for related some basic operation in different represent method, that is beneficial people to improve data process efficiency in practical application. |
| Keywords: | disjoint sets representation and operation time complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |