Dijkstra & amp; rsquo; s algoritme

for (i = 0; i

v [i] = 65 + i;

v0 = 'A';

status [0] = '';

dist [0] = 0;

neste [0] = '*';

for (i = 1; i

{

status [i] = '? ';

dist [i] = a [i] [0];

neste [i] = v0;

}

/* BEHANDLING * /

for (j = 0; j

{

//SKRIVE

printf ("\\ nVERTEX