Hi everyone! could someone please explain to me how to generate a
matching of a weighted bipartite graph so as to maximize the sum of
the weights of the matched edges? I searched for this, the assignment
problem, on google.. but couldnt find any elementary description of
the main algorithms (most were extensions and other research papers
which assumed knowledge of hungarian/ other algorithms). Could anyone
please explain or suggest any good online references?

Thanks in advance,
Bhaskara Aditya