KM算法matlab实现

介绍

带权二分图最佳匹配搜索算法，原理介绍参考上一篇博客KM算法原理+证明

对应的C++版本也在该博客中，C++代码中有详细注释，包括DFS设计的理解：KM算法C++实现

function match = KM(r)
    %r = [3,0,10,2;2,1,3,2;0,0,5,9];
    % r=[0.572727272727273,0.692307692307692,0.585074626865672];
    global g_map;
    global g_m;
    global g_n;
    global g_label_value_x;
    global g_label_value_y;
    global g_match_x;
    global g_match_y;
    global g_min_weight_diff;
    global g_visible_x;
    global g_visible_y;
%%
    %init
    [g_m,g_n]=size(r);
    g_map = r;
    g_label_value_x = zeros(g_m,1);
    g_label_value_y = zeros(g_n,1);
    g_match_x = ones(g_m,1)*-1;
    g_match_y = ones(g_n,1)*-1;
    for i=