Hungarian algorithm: Difference between revisions

Content deleted Content added
B52481 (talk | contribs)
Connection to successive shortest paths: - fix undefined behavior, add more about equivalence
AnomieBOT (talk | contribs)
m Dating maintenance tags: {{Confusing}}
Line 517:
===Step 5===
 
{{Confusing|section|date=May 2023}}
 
'''Find the lowest uncovered value. Subtract this from every unmarked element and add it to every element covered by two lines.'''