首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于L形瓦的无向双环网络直径求解算法
引用本文:刘辉,方木云,郑啸,李颖.基于L形瓦的无向双环网络直径求解算法[J].华中科技大学学报(自然科学版),2012,40(9):48-51.
作者姓名:刘辉  方木云  郑啸  李颖
作者单位:1. 安徽工业大学计算机学院,安徽马鞍山,243002
2. 马鞍山师范高等专科学校,安徽马鞍山,243041
基金项目:国家自然科学基金资助项目(61003311);安徽省教育厅重大项目(ZD2008005-1);安徽省教育厅重点项目(KJ2012A262);安徽工业大学科研项目(QZ201114)
摘    要:针对构造无向双环网络最短路径图(MDD)常用的节点遍历方式较为复杂、割裂了有向双环网络和无向双环网络之间的内在联系的问题,将有向双环网络拓扑结构映射到平面直角坐标系,在得到的L形瓦基础上,对其上的节点坐标通过简单坐标变换,得到无向双环网络MDD上对应节点坐标,进而计算无向双环网络的直径.相对于目前构造无向双环网络MDD或其等价拓扑结构普遍采用节点遍历方式而言,该算法仅增加了几次比较,就改善并提高了无向双环网络直径的求解效率.

关 键 词:有向双环网络  无向双环网络  坐标映射  L形瓦  直径  最短路径图

Calculation method of bidirectional double-loop networks diameter based on L-shape tile
Institution:Liu Hui1 Fang Muyun1 Zheng Xiao1 Li Yin2(1 Department of Computer Science,Anhui University of Technology,Maanshan 243002,Anhui China; 2 Maanshan Teacher’s College,Maanshan 243041,Anhui China)
Abstract:Node traversing method is widely used in constructing minimum distance diagram(MDD) of double-loop networks,which seperates the relationship between the bidirectional double-loop networks and the unidirectional double-loop networks.Firstly topology of unidirectional double-loop networks was reflected in Cartesian coordinates to get minimum distance diagram which was L-shape tile.Then,a method to calculate the diameter of bidirectional double-loop networks was presented based on L-shape tile to change the locations of nodes from the unidirectional region into bidirectional region in Cartesian coordinates.By using this method,the fast algorithm was presented to construct the MDD of bidirectional double-loop networks and calculate the diameter of bidirectional double-loop networks.Compared with node traversing method,this method is based on the L-shape tile and only adds a few steps to calculate,improving research of diameter of the bidirectional double-loop networks efficiently.
Keywords:bidirectional double-loop networks  unidirectional double-loop networks  coordinates relocate  L-shape tile  diameter  minimum distance diagram
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号