AnAlgorithmforshortestPathofDouble·IooP
NetworkSnL(N，h)(hIN)

CHENZhong一xue; GEPan

Volume 14 Issue 4

Aug. 2001

Turn off MathJax

Article Contents

Journal of Southwest Jiaotong University > 2001 > 14(4): 444-447.

CHENZhong一xue, GEPan. AnAlgorithmforshortestPathofDouble·IooPNetworkSnL(N，h)(hIN)[J]. Journal of Southwest Jiaotong University, 2001, 14(4): 444-447.

Citation:

CHENZhong一xue, GEPan. AnAlgorithmforshortestPathofDouble·IooP NetworkSnL(N，h)(hIN)[J]. Journal of Southwest Jiaotong University, 2001, 14(4): 444-447.

CHENZhong一xue, GEPan. AnAlgorithmforshortestPathofDouble·IooPNetworkSnL(N，h)(hIN)[J]. Journal of Southwest Jiaotong University, 2001, 14(4): 444-447.

Citation:

CHENZhong一xue, GEPan. AnAlgorithmforshortestPathofDouble·IooP NetworkSnL(N，h)(hIN)[J]. Journal of Southwest Jiaotong University, 2001, 14(4): 444-447.

PDF( 0 KB)

AnAlgorithmforshortestPathofDouble·IooP NetworkSnL(N，h)(hIN)

Publish Date: 25 Aug 2001

Abstract

Abstract

Thispaperanalyzesakindofdouble一loopnetworksDL(N，h)，wherethegreatesteommon divisor15equaltoh.ItprovesthattheshortestPathbetweenanytwogivennodesinthesenetworks15 oneandonly，andeanbeexpressedwithsimPlemathematiealequations.Theequationsfortheshortest patharepresented，andbasedonthemasimplealgorithm15proposedtofindtheshortestpathforany pairofnodesinthesenetworks.Inaddition，thediameterandotherissuesaboutthiskindofnetworks arediseussed.It15provedthattheaveragedistaneebetweentwonodes15equaltohaifofthediameter.
- networktopology:algorithm,
- double一looPnetwork,
- shortestpath,