Dijkstra's Algorithm with A,B,LOC        N = Nnodes

I,J,K=nodes  H=links
Matrix D[I][J] = W[T]
If nodes I,J are linked then there is a link T such that I=A[T] and J=B[T].
If nodes I,J are not linked (no T exists) then D[I][J] = infinity
See subprogram below ****
if it returns zero change that to MX (very large number)



Step 0
All nodes J receive temporary labels L[J] with value equal to D[1][J] (J=2,3, ..., N). 
if nodes 1,J not linked, then D[1][J]= infinity.
for J=2,...,N, L[J] = D[1][J]

/* initialize L[] */

for J=1,..,N  L[J]=MX;  /* to cover nodes not linked to node 1 */

/* to conver nodes linked to node 1 */
H=1;
while (A[H]==1) {J=B[H]; L[[J]=W[H]; H++;}


Step 1
M=MX;
I=1,..,N  if (L[I]<M) {H=I; M=L[I];}
LS[H]=L[H];
Stop if no L[] left.


Step 2
Replace temp labels of all neighbors of node H:  (no infinity MX involved)

/* for each neighbor J of H, find link number T where H=A[T] and J=B[T] */

K=LOC[H];
(while A[K]==H)
 {
  J=B[K];      /* J = neighbor of H */
  T=LinkNum(H,J);   /* find link number T of link H-J */
  TEMP = LS[H] + W[T];
  if (TEMP < L[J]) L[J] = TEMP; K++;}
 }
goto Step 1.



/***************************************/

/* for nodes I,J find link number K satisfying I=A[K] and J=B[K]; if no link exists, return 0 */

int LinkNum(int I, int J, int *LOC)
{
 K=LOC[I];
 while (A[K]==I) {if (B[K]==J) return K; K++;}
 return 0;
}

/****************************************/