摘要:
二、图论算法1.最小生成树A.Prim算法:procedure prim(v0: Integer);var lowcost, closest: array[1..maxn] of Integer; i, j, k, Min: Integer;begin for i := 1 to n do begin lowcost[i] := cost[v0, i]; closest[i] ... 阅读全文
posted @ 2005-11-04 17:22
吴文力
阅读(2861)
评论(0)
推荐(0)