Welcome to the Java Programming Forums

The professional, friendly Java community. 21,500 members and growing!

The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.

>> REGISTER NOW TO START POSTING

# Thread: MWM Algorithm

1. ## MWM Algorithm

Hi guys.
Any ideas on how to implement the "Maximum Weigth Matching" algorithm?
Pseudocode or any sources would be appreciated.
Thanks a lot.

2. ## Re: MWM Algorithm

You tell us. Exactly what is the MWM algorithm?

3. ## Re: MWM Algorithm

Originally Posted by KevinWorkman
You tell us. Exactly what is the MWM algorithm?
Given a bipartite graph G = (V, E) with bipartition (A, B) and a weight in every edge of the graph it finds the matching of maximum weight.

4. ## Re: MWM Algorithm

Do you have any design or algorithm that you want to code in java and are having troubles with?
Your description of the problem so far is a long way from a program design that you could write code from.

5. ## Re: MWM Algorithm

Originally Posted by andreas90
Given a bipartite graph G = (V, E) with bipartition (A, B) and a weight in every edge of the graph it finds the matching of maximum weight.