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

  sp;            p(i).Judge = True
                End If
            End If
            p(i).fT(j, 1) = (p(i - 1).fT(p(i - 1).jN, 1) + Matrix(p(i).iN, p(i - 1).bT(j, 0)))
            p(i).fT(j, 0) = p(i - 1).bT(j, 0)
        Else
            p(i).fT(j, 1) = p(i - 1).bT(j, 1)
            p(i).fT(j, 0) = p(i - 1).bT(j, 0)
        End If
        If p(i).fT(j, 0) = nE Then
        If p(i).fT(j, 1) > 100 Then
            p(i).Judge = True
        End If
        End If
    Next j
    p(i).jN = seekSmall(p(i).fT())
    n = 0
    For j = 0 To 5 - i
        If p(i).jN <> j Then
            p(i).bT(n, 0) = p(i).fT(j, 0)
            p(i).bT(n, 1) = p(i).fT(j, 1)
            n = n + 1
        End If
    Next j
Next i
For i = 0 To 5
    If p(i).iN = nE Then
  &nbs

上一页  [1] [2] [3] [4] [5] [6] 下一页