Skip to content

Latest commit

 

History

History
11 lines (8 loc) · 744 Bytes

README.md

File metadata and controls

11 lines (8 loc) · 744 Bytes

Kuhn-Munkres-Algorithm

A python program to solve assignment problem by the Kuhn–Munkres algorithm (The Hungarian Method). The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time.

Start by defining the size of the matrix:

1

Enter your values and click solve:

2

You have the option to parse a string representation of the matrix by clicking parser:

3