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

以下是一个基于Dijkstra算法的matlab实现，用于找到一个联合站点，使得所有油井到联合站的路径最短。

% 坐标数据
oil_wells = [
    0.2 0.1;
    0.1 0.2;
    0.3 0.2;
    0.4 0.1;
    0.6 0.1;
    0.8 0.1;
    0.9 0.2;
    0.8 0.3;
    0.6 0.3;
    0.4 0.3;
    0.3 0.4;
    0.5 0.5;
    0.7 0.5;
    0.9 0.5;
    0.1 0.6;
    0.3 0.6;
    0.5 0.7;
    0.2 0.8;
    0.4 0.8;
    0.6 0.8;
    0.8 0.8;
    0.5 0.9;
];

% 构建邻接矩阵
n = size(oil_wells, 1) + 1; % n个顶点（油井和联合站）
adj_matrix = zeros(n, n);
for i = 1:n-1
    for j = i+1:n-1
        d = norm(oil_wells(i,:) - oil_wells(j,:));
        adj_matrix(i,j) = d;
        adj_matrix(j,i) = d;
    end
end

% 计算油井到联合站的距离
s = n; % 联合站的编号
d = zeros(n-1, 1);
for i = 1:n-1
    d(i) = dijkstra(adj_matrix, s, i);
end

% 找到最短路径
[~, idx] = min(sum(adj_matrix(1:n-1,1:n-1), 2) + d); % 找到总路径最短的联合站
fprintf('联合站坐标：(%f, %f)\n', oil_wells(idx,:));

% Dijkstra算法实现
function [dist, prev] = dijkstra(adj_matrix, s, t)
    n = size(adj_matrix, 1);
    dist = inf(n, 1);
    prev = zeros(n, 1);
    visited = false(n, 1);

    dist(s) = 0;
    for i = 1:n-1
        [~, u] = min(dist(~visited));
        if isempty(u)
            break;
        end
        u = find(~visited, 1) + u - 1;
        visited(u) = true;
        for v = 1:n
            if ~visited(v) && adj_matrix(u,v) > 0
                alt = dist(u) + adj_matrix(u,v);
                if alt < dist(v)
                    dist(v) = alt;
                    prev(v) = u;
                end
            end
        end
    end
    if nargin > 2 && t > 0
        path = [];
        while t ~= s
            path = [t path];
            t = prev(t);
        end
        path = [s path];
        if dist(path(2)) == inf
            path = [];
        end
    end
end