Hello !!! Give an algorithm for finding the maximum match in general weighted graphs, using max incremental weight property. I think we have to first find out all the augmenting paths and then select the one having maximum incremental weight and proceed. But how to find all the augmenting paths? Plz give all the steps for that.
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
