Rank: 21761 based on 0 downloads (last 30 days) and 0 file submitted

Gokhan Gulgezen

Istanbul Technical University

Personal Profile:


Watch this Author's files


Comments and Ratings by Gokhan Gulgezen
Updated File Comments Rating
26 Nov 2008 Hungarian Algorithm An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph. Author: Alexander Melin

The algorithm works pretty well I think but I need to find maximum weight matching of a bipartite graph not minimum.
So can I use this code to find the maximum weight matching of a bipartite graph just multiplying the performance matrix with negative. Is there anyone to help me or provide information for finding maximum weight matching.
Thanks in advance.


Contact us