Question

explain Hungarian algoritham ​

Answer 1

$\huge {\underline{\red {Answer}}}$

The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal–dual methods.

________________________________

Answer 2

Answer:

The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal–dual methods.