匈牙利算法的matlab代码

以下是匈牙利算法的Matlab代码示例：

function [matching] = hungarian_algorithm(cost_matrix)
    % 初始化
    m = size(cost_matrix, 1);
    n = size(cost_matrix, 2);
    matching = zeros(1, n);
    slack = zeros(1, n);
    visited_x = zeros(1, m);
    visited_y = zeros(1, n);
    
    % 在每一行中找到最小值并减去
    for i = 1:m
        min_val = min(cost_matrix(i, :));
        cost_matrix(i, :) = cost_matrix(i, :) - min_val;
    end
    
    % 开始匹配
    for i = 1:m
        while true
            visited_x(:) = 0;
            visited_y(:) = 0;
            if find_path(i)
                break;
            else
                % 更新标记
                min_val = inf;
                for j = 1:n
                    if visited_y(j) == 0
                        min_val = min(min_val, slack(j));
                    end
                end
                for j = 1:m
                    if visited_x(j) == 1
                        cost_matrix(j, :) = cost_matrix(j, :) - min_val;
                    end
                end
                for j = 1:n
                    if visited_y(j) == 1
                        cost_matrix(:, j) = cost_matrix(:, j) + min_val;
                    end
                end
            end
        end
    end
    
    % 构建匹配结果
    for i = 1:n
        if matching(i) ~= 0
            matching(matching(i)) = i;
        end
    end
    
    function [found] = find_path(x)
        visited_x(x) = 1;
        for y = 1:n
            if visited_y(y) == 0 && cost_matrix(x, y) == 0
                visited_y(y) = 1;
                if matching(y) == 0 || find_path(matching(y))
                    matching(y) = x;
                    found = true;
                    return;
                end
            elseif visited_y(y) == 0
                slack(y) = min(slack(y), cost_matrix(x, y));
            end
        end
        found = false;
    end
end