Hungarian optimum assignment algorithm with Java computer animation
Ivan Makohon, Mecit Cetin, Duc T. Nguyen, ManWo Ng · 2016
The classical, popular Hungarian algorithm for solving the “optimum assignment” problems (with its broad engineering/science applications) has been well-documented in the literature. Other (more efficient) variations of the Hungarian algorithm have also been extensively studied by the research communities. In this paper, the basic Hungarian algorithm is revisited, with the ultimate goal of developing a useful, user friendly, attractive Java computer animation for “effectively teaching” this basic/important optimum assignment algorithm. The final product from this work will help both the students and their instructor to not only mastering this technical subject, but also provide valuable tool for obtaining the solutions for homework assignments, class examinations, self-assessment tools, etc. A demo video of the Hungarian Algorithm's animation and result can be viewed online from any web browser using the website provided in reference [9].