swap greedy matching for maximum matching
Opened this issue · 1 comments
sdrogers commented
e.g. networkx implementation of matching algorithms (refs in SI of acquisition paper)...
see e.g. https://en.wikipedia.org/wiki/Matching_(graph_theory)#Online_bipartite_matching
sdrogers commented
can parameterise so that either greedy or max are used, or max weight where weight is inversely proportional to peak distances, after correction by current function