写了一个spfa，结果AC，写了个dijks，结果样例都不对，求大神帮我看看哪里有错。
const k=1000;
var map:array[1..k,1..k] of integer;
path:array[1..k] of integer;
s:array[1..k] of boolean;
dist:array[1..k] of longint;
n:integer;

procedure init;
var i,j:longint;
begin
readln(n);
for i:=1 to n do
begin
for j:=1 to n do
read(map[i,j]);
if map[i,j]=0 then map[i,j]:=maxint;
end;
end;

procedure print(i:integer);
var pre:integer;
begin
if i=1 then write(1)
else begin
print(path[i]);
write(' ',i);
end;
end;

procedure dijks;
var i,j,k,min,vj:longint;
begin
for i:=1 to n do s[i]:=false;
for i:=1 to n do path[i]:=1;
for i:=1 to n do dist[i]:=map[i,j];
s[1]:=true;
for k:=1 to n-2 do
begin
min:=maxint;
for j:=1 to n do
if (dist[j]<min) and not s[j] then
begin
min:=dist[j];
vj:=j;
end;
if min=maxint then exit;
s[vj]:=true;
for j:=1 to n do
if min+map[vj,j]<dist[j] then
begin
dist[j]:=min+map[vj,j];
path[j]:=vj;
end;
end;
print(j);
writeln;
writeln(dist[j]);
end;

begin
init;
dijks;
end.