Background: Write the function SPP of the shortest path problem from starting point 1 to end point n, based on Dijkstra's idea of shortest path
n: the number of nodes, the node number is 1,2... ,n
t is the matrix where t(I,j) represents the distance from node I to the directly connected edges of node j. If there is no directly connected edge from I to j, then T of I,j is equal to Inf of infinity.
and when I write:
It shows an error: "Array indices must be positive integers or logical values."