Hungarian Assignment

Hungarian Assignment-37
Before submitting the program as a python script, I realized that the teacher who requested the program shouldn't be dealing with the nitty gritties of command line.Hence, I came across the tkinter Python library for creating GUI's.The code also enables computing a maximum assignment by changing the input matrix.

Everybody in the batch now took a copy of my program and submitted it.

There were a lot of things I learnt in this project, both technical and psychological.

It doesn't take a genius to figure out that the machine on which Sir would eventually run might not even contain the python binary, let alone GUI support for Tkinter. At the end, I converted the python program to an executable that's portable enough to run on most computers. D, sparing him the troubles of git clone and submitted it to my professor.

Later that day, I received an email saying that the program was very helpful and he can now quickly create custom questions and verify its correctness while checking the answer sheets.

TODO(user): base this code on Linear Sum Assignment.

An O(n^4) implementation of the Kuhn-Munkres algorithm (a.k.a.Just like we need a compiler for C , we need the python interpreter installed. The first modern polynomial time algorithm for the assignment problem, invented by Harold W.I researched for a day, and then went ahead executing the GUI with Tkinter. However, once again I was in a fix because while preparing the Git Hub readme, in the prerequisites section, I mentioned Python as it was necessary for the project.I was using a Linux Machine with all the utilities installed.Kuhn half a century ago, was christened the “Hungarian method” to highlight that it derives from two older results, by K˝onig and Egerv´ary .In spite of its simplicity, in the last fifty years this problem attracted hundreds of researchers, accompanying and sometimes anticipating the development of Combinatorial Optimisation.You can use the Dijkstra algorithm to compute the shortest path from the source node to any other node.You can use the Floyd-Warshall algorithm to compute the shortest path from any node to any node.By continuing to use this site, you consent to the use of cookies.We use cookies to offer you a better experience, personalize content, tailor advertising, provide social media features, and better understand the use of our services.


Comments Hungarian Assignment

The Latest from ©