KevinStern / software-and-algorithms

Neat algorithm implementations in Java.
MIT License
118 stars 70 forks source link

remove redundant code #12

Open Yay295 opened 6 years ago

Yay295 commented 6 years ago

computeInitialFeasibleSolution() just gets the minimum value from each row and puts them in labelByJob. However, computeInitialFeasibleSolution() is only called once, right after calling reduce(), so the minimum value in each row is zero. Since labelByJob is already zero, this does nothing.

Likewise in greedyMatch(), labelByWorker and labelByJob are filled with zero's, so subtracting them does nothing.