Timeline for Matching algorithm, match pairs: what would be the right way to do it?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 20, 2017 at 8:51 | vote | accept | eyjin | ||
| Jan 19, 2017 at 8:40 | comment | added | David Richerby | It's a standard algorithm so you'll probably find it implemented by libraries. You'll also need to set up the weights. But programming advice is off-topic, here: Stack Overflow will probably be able to help you. | |
| Jan 19, 2017 at 8:38 | comment | added | eyjin |
Thanks for your advice! Hmm I'm not sure if I'm skilled enough to solve this maximum weighted matching problem, since I'm an beginner in programming for 8 years now ;-). Do you think with my basic knowledge of Java and Matlab it is possible for me? And I think yes, the weighted graph in this case would be data0: 50 50 50 50 50
|
|
| Jan 17, 2017 at 17:49 | history | answered | David Richerby | CC BY-SA 3.0 |