2016算法与结构课件第五章贪心法华北电力大学科技学院.pptVIP

template class Type void Prim(int n,Type * *c) { Type lowcost[maxint]; int closest[maxint]; bool s[maxint]; s[1]=true; for (int i=2; i=n; i++) { lowcost[i]=c[1][i]; closest[i]=1; s[i]=false; } for (int i=1; in; i++) { Type min=inf; int j=1; for (int k=2; k=n; k++) Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Pr