Porting of max_weighted_matching #52
Comments
|
I guess it depends on the data structure your implementation expects. If it can be adjusted to work with JSNetworkX graphs then it would be great to have it! |
|
Ok I think I can do this. This should be put in a file named JSNetworkX/src/algorithms/matching.js, right? |
make-github-pseudonymous-again
added a commit
to aureooms-contrib/JSNetworkX
that referenced
this issue
Aug 12, 2015
new files
==
- src/algorithms/matching.js (coverage 96.21%)
- jsnx.maxWeightMatching
- jsnx.maximalMatching
- src/algorithms/__tests__/matching-test.js
modified files
==
- package.json
- corrected a typo in script/cover (nom -> npm)
- src/_internals/Set.js
- added an `update` method to the set class (like Python's set update)
`union` for sets rewritten to use this new method
- src/algorithms/index.js
- added exports for new matching algorithms
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
I have a JavaScript version of the
max_weighted_matchingprocedure here. It is not a port of the NetworkX version but of the original implementation made by Joris van Rantwijk. I do not know if this can help.The text was updated successfully, but these errors were encountered: