修改以下matlab代码：%导入数据 NumPoints = size(village_number,1); %节点数量 edges = []; % 道路[] edge_cost = []; % 道路成本[] % 计算每个村庄到每个医疗点的距离矩阵 D = zeros(NumPoints, 3); % 距离矩阵 for i = 1:NumPoints for j = 1:3 D(i,j) = sqrt((village_number(i,4)-village_number(j

,4))^2 + ((village_number(i,5)-village_number(j,5))^2); end end % 构建完全图并计算边的成本 for i = 1:NumPoints for j = i+1:NumPoints edges = [edges; i j]; % 添加边 edge_cost = [edge_cost; D(i,j)]; % 添加成本 end end % 使用带权图算法计算最小生成树 [T,pred] = graphminspantree(sparse(edges(:,1),edges(:,2),edge_cost), 'Method', 'Kruskal'); % 绘制最小生成树 G = graph(edges(:,1),edges(:,2),edge_cost); % 构建完全图 subplot(1,2,1); plot(G); title('Complete Graph'); TEdges = table(T,'VariableNames',{'Weight'},'RowNames',arrayfun(@(x) num2str(x), edges,'UniformOutput',false)); % 构建最小生成树表格 subplot(1,2,2); plot(T,'EdgeLabel',TEdges.Weight); title('Minimum Spanning Tree');