Description: Hungarian algorithm to solve the maximum matching problem s is the best match of the total weight e (:, [1,2]) to match the two points, e (:, 3) for the right match
To Search:
File list (Check if you may need any files):
匈牙利算法
..........\fc01.asv
..........\fc01.m
..........\fc02.m
..........\fc03.m
Download