KM算法（可能是是网络上仅有正确的matlab版）

最新推荐文章于 2024-01-19 00:30:00 发布

「已注销」

最新推荐文章于 2024-01-19 00:30:00 发布

阅读量4.5k

点赞数 7

分类专栏：数学建模文章标签：图匹配

本文链接：https://blog.csdn.net/weixin_38970751/article/details/81583880

版权

function result = KM()
 clear all;
 global n;
 global nx;
 global ny; 
 global lx;
 global ly;
 %global g;
 global  slack;
 global visx;
 global visy;
 global INF;
global g; 
global linker;
g=[ 3 5 5 4 1;
 2 2 0 2 2 ;	
 2 4 4 1 0	;
 0 1 1 0 0;	
 1 2 1 3 3];
 INF = 7000000000;
 n = 5;
  nx =n;
  ny = n;
%%%%%%%%%%%%%%%%%KM算法O(n3)
  %%%%%%%%%%进行初始化
 for i = 1:1:400
linker(i) = -1;
end

for i = 1: 1:10000
lx(i) = 0;
end
%lx[]=0;

for i = 1:1: 10000
ly(i) = 0;
end
for i = 1:1:nx
    
        lx(i) = -1 * inf;  
      %  for(int j = 1; j <= ny; j++)  
       for j = 1: ny
      if g(i,j) > lx(i) 
                lx(i) = g(i,j);  
      end
       end
end  
    for x =1 :1:nx
        %(int x = 1; x <= nx; x++)  
      for i =1 :ny 
            slack(i) = INF;  
      end
        while 1 
        
            for i =1 :1: 1000