最短路径算法源码(VB)集锦.docVIP

本例以由拓扑关系的arc/info 文件为数据源。其中a1,b1,c1是以fnode排序生成的数组，a1对应fnode,b1对应tnode,c1对应length,同样a2,b2,c2,是以tnode 生成的数组。Indexa1是对应某一起点与其相连的终点的个数，indexb1时对应某一终点与其相连的起点的个数，即其拓扑关系。JW](yTQ5P0Public Function shortpath(startno As Integer, endno As Integer) As Single-|5ymJ5mM U+q0以开始点，结束点为参数。$AO$_4iZy U J0Dim result() As SingleMSCBSC | 移动通信网 ZCf j\Dim result1 As IntegerMSCBSC | 移动通信网u+Q%c%sr:~1r+d定义结果点MSCBSC | 移动通信网,[}c:T8Z*BKDim s1 As Single5?(R]oF U-j*Mj0Dim min As SingleC;?.lkU0Dim ii, I, j, aa As IntegerMSCBSC | 移动通信网\+g v(@ g1V:WeG8rDim yc() As BooleanMSCBSC | 移动通信网 cJ8s$P p
BpK)gaDim ycd() As BooleanMSCBSC | 移动通信网_wiL-A HDim rs1() As Single+waZ E0x0Dim no() As IntegerMSCBSC | 移动通信网$O@ Gd l6G1wDim nopoint As Integer~SXOi6}z0S0ReDim yc(1 To maxno) As Boolean(U{sxO+N)I!vCInwh0ReDim ycd(1 To maxno) As BooleanMSCBSC | 移动通信网Bq8c~6wlReDim rs1(1 To maxno) As SingleMSCBSC | 移动通信网KSl^mReDim result(1 To 2, 1 To maxno) As Singlelt f*U/I7y0x0定义结果，其中result(1,maxno)为结果点，result(2,maxno)为结果长度。3^qD7S ^U8T0For I = 1 To maxno// maxno为网中最大的节点数。:bN*S!w.qT:s@]T0Yc(i) = False //标记已经查过的点。MSCBSC | 移动通信网T M`oeYYcd(i) = False //标记已经作结果点用过的点2Z.H(j[x3pAT_1l0rs1(i) = 1E+38 //假设从起点到任一点的距离都为无穷大L][+l j/q ct,Zp|/P0Next IMSCBSC | 移动通信网:e/d!AmU9KA$u7Ull = startno //设置开始点。5J])|PN0Yc(ll) = True //标记开始点为真。即已经作结果点用过。o\9i
u0L$i$r0\0J = 0n-D gcK0VCEC[0For aa = 1 To maxnoMSCBSC | 移动通信网V P$RxIE(yw,aJ先从与开始点相连的终点寻找 MSCBSC | 移动通信网 sq7M3Ch(L IFor I = 1 To indexa1(2, ll) //以与ll点相连的起点的个数循环@y$L `q6R`$o$j,|
n iA0result1 = b1(indexa1(1, ll) - I + 1)找出与LL点相连的终点的点号{oQgcG(u
{(ME0s1 = c1(indexa1(1, ll) - I + 1) + result(2, ll)找出长度并求和*x2jh,c7o [4X-g.o}0If yc(result1) = True Then GoTo 200如果以被经查过进行下一个MSCBSC | 移动通信网B`qM Z}If ycd(result1) = True Then//如果已经作为结果点判断哪一个长MSCBSC | 移动通信网W l+[#E4d4AIf rs1(result1) = s1 Then//如果这一点到起点的长度比现在的路线长，替代MSCBSC | 移动通信网 e;v-A
Z k1VYrs1(result1) = s1MSCBSC | 移动通信网.s