Hungarian algorithm: Difference between revisions

Content deleted Content added
Step 4: Replace "crossed" with "covered" for clarity ("crossed" was not used before and one can wonder if it means something new).
Step 4: make clear that value is uncovered (based on https://medium.com/@riya.tendulkar/the-assignment-problem-using-hungarian-algorithm-4f105729af18)
Line 277:
===Step 4===
 
'''FromFind the elementslowest that are left, find the lowestuncovered value. Subtract this from every unmarked element and add it to every element covered by two lines.'''
 
This is equivalent to subtracting a number from all rows which are not covered and adding the same number to all columns which are covered. These operations do not change optimal assignments.