早教吧作业答案频道 -->数学-->
求下面函数的解释,看不懂function A = fun(W)[m,n] = size(W); e = 0;for i = 1 :mfor j = i :nif W(i,j) = 0e = e + 1;E(e,:) = [i,j,W(i,j)];endendend% 按权值大小排列边的顺序for i = 1 :e - 1for j = i + 1 :eif E(i,3) > E(j,3)temp = E(j,
题目详情
求下面函数的解释,看不懂
function A = fun(W)
[m,n] = size(W);
e = 0;
for i = 1 :m
for j = i :n
if W(i,j) = 0
e = e + 1;
E(e,:) = [i,j,W(i,j)];
end
end
end
% 按权值大小排列边的顺序
for i = 1 :e - 1
for j = i + 1 :e
if E(i,3) > E(j,3)
temp = E(j,:);
E(j,:) = E(i,:);
E(i,:) = temp;
end
end
end
A = zeros(1,3);
S = 1 :n;
for i = 1 :e
% if find-set(u) = find-set(v)
if S(E(i,1)) = S(E(i,2))
% A = A + (u,v)
A = cat(1,A,E(i,:));
%union(u,v)
indicator = S(E(i,1));
for j = 1 :n
if S(j) == indicator
S(j) = S(E(i,2));
end
end
end
end
A(1,:) = [];
MATLAB求解求不出来。
function A = fun(W)
[m,n] = size(W);
e = 0;
for i = 1 :m
for j = i :n
if W(i,j) = 0
e = e + 1;
E(e,:) = [i,j,W(i,j)];
end
end
end
% 按权值大小排列边的顺序
for i = 1 :e - 1
for j = i + 1 :e
if E(i,3) > E(j,3)
temp = E(j,:);
E(j,:) = E(i,:);
E(i,:) = temp;
end
end
end
A = zeros(1,3);
S = 1 :n;
for i = 1 :e
% if find-set(u) = find-set(v)
if S(E(i,1)) = S(E(i,2))
% A = A + (u,v)
A = cat(1,A,E(i,:));
%union(u,v)
indicator = S(E(i,1));
for j = 1 :n
if S(j) == indicator
S(j) = S(E(i,2));
end
end
end
end
A(1,:) = [];
MATLAB求解求不出来。
▼优质解答
答案和解析
这是一个以算法、权值平均数为基础的复合函数,很多的赋值语句是计算机选修中VB的专用语句,解答出来非常麻烦,所以推荐你看一下这两本书(高一数学必修3,第一章,算法初步)与(算法与程序设计,VB选修).这两本书都是高一学的.
希望对您有帮助
希望对您有帮助
看了 求下面函数的解释,看不懂fu...的网友还看了以下:
提示:D-C=0A-B,A-D,D-C,D-E,E-F=1A-D,C-F=2A-B,D-E,E-F 2020-04-06 …
求极限1:lim[(n-3)/(2n-1)]∧2.要解法 2:因为:lim[1+(1/n)]∧n= 2020-05-16 …
把i n w n e r s组成单词 2020-05-16 …
f(x)=e^x-kx,设函数F(x)=f(x)+f(-x),求证F(1)F(2)……F(n)>[ 2020-05-21 …
main(){unionEXAMPLE{struct{intx,y;}in;inta,b;}e;e 2020-06-12 …
用以下英文宇母填在上a,a,a,a,a,a,b,e,e,d,e,e,e,e,e,e,f,g,g用以 2020-06-24 …
d/dx(e^y+xy-e)=e^ydy/dx+y+xdy/dx,这是教科书上的等式,对等式左边x 2020-07-19 …
选出下列词语中读音有误的一组()A.股肱(gōng)蜿(wān)蜒宁(nìng)可角(jué)色B. 2020-11-06 …
2-1设文法G[E]的产生式集为:EàE+T|E-T|TTàT*F|T/F|FFà(E)|i(1)给 2020-11-26 …
下列词语中加点字的注音,全都正确的一组是()A.修葺(qì)楷(kǎi)模愠(wēn)怒病入膏肓(h 2020-12-17 …