家庭口罩分配与最短距离计算：优化口罩分配方案，降低配送成本

new_data = data;

% 将正数的家庭给负数的家庭口罩 for i = 1:n if diffneed(i) > 0 for j = 1:n if diffneed(j) < 0 && data(j, 2) >= diffneed(i) new_data(i, 2) = new_data(i, 2) - diffneed(i); new_data(j, 2) = new_data(j, 2) + diffneed(i); diffneed(i) = 0; diffneed(j) = diffneed(j) + diffneed(i); break; end end end end

% 计算新的距离矩阵 new_dist = pdist(new_data(:, 2:5), 'euclidean');

% 将距离矩阵转换成邻接矩阵 new_adj = zeros(n); for i = 1:n-1 for j = i+1:n d = new_dist((i-1)*(n-i/2)+j-i); new_adj(i,j) = d; new_adj(j,i) = d; end end

% 使用Dijkstra算法计算最短总距离 distances = dijkstra(new_adj, 1); total_distance = sum(distances);

% 输出结果 disp('最短总距离为：'); disp(total_distance);