第七章 图与网络分析模型选讲.ppt

while k1n min=inf; for m1=1:k1 for m2=1:k2 t=w(T(m1),S(m2)); if tmin min=t; u=T(m1); v=S(m2); end end end T=[T,v]; S=setdiff(S,v); A=[A,u];B=[B,v]; L=[L,min]; k1=length(T);k2=length(S); end Tch=sum(L); Prim算法： 图G(V,E,W) (1)T={v1}, Q=[] S=setdiff(V,T), (2)找顶点u与v满足： T={T,v},S=setdiff(S,v) Q =[Q, uv] (3)若T=V结束循环 否则转向(2) * 例7.8某单位有10个下属部门，均不在同一地点办公，为了实现部门之间的资源共享，该单位打算对原有网络进行改造，将所有各部门通过光缆连接组成园区网。根据前期的考察预测，各部门间的光缆连接费用如下表， 试问该单位应如何铺设光纤能使得成本最低，且保证所属单位之间的连通？ 1 2 3 4 5 6 7 8 9 10 1 0 33 51 52 38 61 61 49 53 51 2 33 0 44 71 48 51 60 50 49 41 3 51 44 0 66 43 58 62 34 35 55 4 52 71 66 0 62 56 61 37 49 48 5 38 48 43 62 0 55 52 40 28 49 6 61 51 58 56 55 0 53 39 49 49 7 61 60 62 61 52 53 0 55 50 56 8 49 50 34 37 40 39 55 0 64 46 9 53 49 35 49 28 49 50 64 0 48 10 51 41 55 48 49 49 56 46 48 0 * clc,clear w=[0,33,51,52,38,61,61,49,53,51;33,0,44,71,48,51,60,50,49,41;51,44,0,66,43,58,62,34,35,55;52,71,66,0,62,56,61,37,49,48;38,48,43,62,0,55,52,40,28,49;61,51,58,56,55,0,53,39,49,49;61,60,62,61,52,53,0,55,50,56;49,50,34,37,40,39,55,0,64,46;53,49,35,49,28,49,50,64,0,48;51,41,55,48,49,49,56,46,48,0] [A,B,tch]=primg(w,1) n=length(w);W=zeros(n); for i=1:n-1 W(A(i),B(i))= w(A(i),B(i)); end ids={v1,v2,v3,v4,v5,v6,v7,v8,v9,v10}; h=view(biograph(W,ids,ShowArrows,off,ShowWeights,on)) set(h.Nodes,shape,circle); %顶点画成圆形 * A = 1 1 5 9 3 8 8 2 9 B = 2 5 9 3 8 4 6 10 7 tch = 335 * Matlab中求最小生成树的命令： [st,pred]=graphminspantree(w) clc,clear w=[0,33,51,52,38,61,61,49,53,51;33,0,44,71,48,51,60,50,49,41;51,44,0,66,43,58,62,34,35,55;52,71,66,0,62,56,61,37,49,48;38,48,43,62,0,55,52,40,28,49;61,51,58,56,55,0,53,39,49,49;61,60,62,61,52,53,0,55,50,56;49,50,34,37,40,39,55,0,64,46;53,49,35,49,28,49,50,64,0,48;51,41,55,48,49,49,56,46,48,0]；