赵婷婷, 梁立, 高云. 基于拟拓扑的有限集上拓扑构建递推算法[J]. 云南大学学报(自然科学版), 2013, 35(6): 744-749. doi: 10.7540/j.ynu.20130347
引用本文: 赵婷婷, 梁立, 高云. 基于拟拓扑的有限集上拓扑构建递推算法[J]. 云南大学学报(自然科学版), 2013, 35(6): 744-749. doi: 10.7540/j.ynu.20130347
ZHAO Ting-ting, LIANG Li, GAO Yun. Recursive algorithm based on quasi-topology to construct topologies on a finite set[J]. Journal of Yunnan University: Natural Sciences Edition, 2013, 35(6): 744-749. DOI: 10.7540/j.ynu.20130347
Citation: ZHAO Ting-ting, LIANG Li, GAO Yun. Recursive algorithm based on quasi-topology to construct topologies on a finite set[J]. Journal of Yunnan University: Natural Sciences Edition, 2013, 35(6): 744-749. DOI: 10.7540/j.ynu.20130347

基于拟拓扑的有限集上拓扑构建递推算法

Recursive algorithm based on quasi-topology to construct topologies on a finite set

  • 摘要: 为了更好地解决拓扑计数问题,提出利用递推算法来构建拓扑.该算法从拓扑的结构性质出发,研究了拓扑间的递推关系;基于封闭性提出了拟拓扑的概念,并将其应用于拓扑的构建,生成所有的拓扑.实验测试表明:随着元素个数不断增加,该算法相对于传统的穷举算法所表现出来的优势越来越明显.

     

    Abstract: The recursive algorithm is applied to solve the topologies counting problem.By researching topological structure properties,a recursive pattern is found.Using closed property,the article defines quasi-topology as a new concept and uses it to construct topology.All the topologies are generated by this method.When increasing the number of elements,this algorithm shows more and more obvious advantage compared with the traditional enumeration method.

     

/

返回文章
返回