C. Dijkstra 算法: vara:array[1..maxn,1..maxn] of integer;b,pre:array[1..maxn] of integerC. 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);