双环网络DL(N,h)(h}N)的最短路径算法
AnAlgorithmforshortestPathofDouble·IooP NetworkSnL(N,h)(hIN)
-
摘要: 对双环网络DL(N,h)(满足最大公因数抓N,h)二h)进行了分析,证明了这类双环网络中最短路径形 式唯一且可用简单的数学表达式来描述,给出了最短路径的公式。在此基础上给出了一个求最短路径的简便算 法,讨论了该类网络的直径等有关问题,证明了两点间的平均距离等于直径的一半。Abstract: Thispaperanalyzesakindofdouble一loopnetworksDL(N,h),wherethegreatesteommon divisor15equaltoh.ItprovesthattheshortestPathbetweenanytwogivennodesinthesenetworks15 oneandonly,andeanbeexpressedwithsimPlemathematiealequations.Theequationsfortheshortest patharepresented,andbasedonthemasimplealgorithm15proposedtofindtheshortestpathforany pairofnodesinthesenetworks.Inaddition,thediameterandotherissuesaboutthiskindofnetworks arediseussed.It15provedthattheaveragedistaneebetweentwonodes15equaltohaifofthediameter.
-
Key words:
- networktopology:algorithm /
- double一looPnetwork /
- shortestpath /
点击查看大图
计量
- 文章访问数: 1285
- HTML全文浏览量: 53
- PDF下载量: 83
- 被引次数: 0