C. Dijkstra 算法：vara:array[1..maxn,1..maxn] of integer;b,pre:array[1..maxn] of integer; {pre[i]指最短路径上I的前驱结点}mark:array[1..maxn] of boolean;procedure dijkstra(v0:integer);
C. Dijkstra 算法：
var
a:array[1..maxn,1..maxn] of integer;
b,pre:array[1..maxn] of integer; {pre[i]指最短路径上I的前驱结点}
mark:array[1..maxn] of boolean;
procedure dijkstra(v0:integer);
相关考题：
以下所列的过程中，正确的是 ______。A．void play(var a: Integer, var b: Integer)B．Sub play(int a,B)C．void play(int a, intB)D．Sub play(a As Integer, b As Integer)
以下所列的各个方法头部中,正确的是()A、voidplay(vara:Integer,varb:integer)B、voidplay(inta,intc)C、voidplay(inta,intb)D、Subplay(aasinteger,basinteger)
以下所列的各函数首部中，正确的是______。A．void play(var a：Integer,var b：Integer)B．void play(int a,b)C．void play(int a,int b)D．Sub play(a as integer,b as integer)
最小生成树A.Prim算法：procedure prim(v0:integer);varlowcost,closest:array[1..maxn] of integer;i,j,k,min:integer;
最短路径A.标号法求解单源点最短路径：vara:array[1..maxn,1..maxn] of integer;b:array[1..maxn] of integer; {b[i]指顶点i到源点的最短路径}mark:array[1..maxn] of boolean;procedure bhf;varbest,best_j:integer;
高精度数的定义：typehp=array[1..maxlen] of integer;1．高精度加法procedure plus ( a,b:hp; var c:hp);var i,len:integer;
下列不是Android的数组资源标签的是A．＜array/＞B．＜text-array/＞C．＜integer-array/＞D．＜string-array/＞