用matlab写出下面算法：一个坐标上有22口油井坐标，加入一个联合站点坐标，使油井连接到联合站路径最短

% 假设油井坐标存储在一个22x2的矩阵中，如下
oil_well = [1 2; 3 4; 5 6; 7 8; 9 10; 11 12; 13 14; 15 16; 17 18; 19 20; ...
21 22; 23 24; 25 26; 27 28; 29 30; 31 32; 33 34; 35 36; 37 38; ...
39 40; 41 42; 43 44];

% 随机生成一个联合站点坐标
joint_station = [randi(50) randi(50)];

% 构建距离矩阵
dist_matrix = zeros(23);
for i = 1:22
for j = 1:22
dist_matrix(i,j) = norm(oil_well(i,:)-oil_well(j,:));
end
dist_matrix(i,23) = norm(oil_well(i,:)-joint_station);
dist_matrix(23,i) = dist_matrix(i,23);
end

% 求解最短路径
[~,path] = dijkstra(dist_matrix,23,1:22);

% 输出最短路径
fprintf('联合站点坐标为 (%d,%d)\n',joint_station(1),joint_station(2));
fprintf('最短路径为:\n');
for i = 1:numel(path)-1
fprintf('油井%d到油井%d的距离为%.2f\n',path(i),path(i+1),dist_matrix(path(i),path(i+1)));
end
fprintf('总距离为%.2f\n',sum(dist_matrix(path(1:end-1),path(2:end))))；

% dijkstra算法实现
function [D,path] = dijkstra(W,s,t)
n = size(W,1);
D = inf(1,n);
D(s) = 0;
T = 1:n;
while ~isempty(T)
[~,u] = min(D(T));
if u == t
break;
end
T(T==u) = [];
for v = T
if W(u,v)~=0 && D(u)+W(u,v)<D(v)
D(v) = D(u)+W(u,v);
end
end
end
if D(t) == inf
path = [];
else
path = t;
while path(1)~=s
for i = 1:n
if W(path(1),i)~=0 && D(i)+W(path(1),i)==D(path(1))
path = [i path];
break;
end
end
end
end
end