The Hungarian Algorithm and Python Code - Computer Science Assignment Help

Assignment Task

1. Write a python code that will generate the minor matrix of a given a nxn matrix.

2. The Hungarian Algorithm is used to find the minimum cost when assigning Jobs to machines based on cost, and each machine must be assigned to a different job.

Step 1: Create zero elements in the cost matrix by subtracting the smallest element in each row from the corresponding row.

Step 2: Repeating the same with columns, the final matrix can be obtained.

Step 3: Cover all zeros with the minimum number of lines - Using the smallest number of lines possible, draw lines over rows and columns in order to cover all zeros in the matrix. If the number of lines is equal to the number of rows in your square matrix, stop here. Otherwise, go to step 4.

Step 4: Create additional zeros - Find the smallest element - call it c - that isn't covered by a line. Subtract c from all uncovered elements in the matrix and add it to any element that's covered twice. Go back to step 3.

This Computer Science Assignment has been solved by our Law experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.