procedure prim(v0:integer); var lowcost,closest:array[1..maxn] of integer; i,j,k,min,ans:integer; for i:=1 to n do begin lowcost[i]:=cost[v0,i]; ...
確定! 回上一頁