explain Hungarian algoritham
Answers
Answered by
3
Answer:
The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal–dual methods. ... Ford and Fulkerson extended the method to general maximum flow problems in form of the Ford–Fulkerson algorithm.
Answered by
0
Step-by-step explanation:
The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal–dual methods. ... Ford and Fulkerson extended the method to general maximum flow problems in form of the Ford–Fulkerson algorithm.
Similar questions