search

sdrogers / CLGP

Closed-loop GP example
0 stars 0 forks source link

swap greedy matching for maximum matching #1

Open sdrogers opened 4 years ago

sdrogers commented 4 years ago

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 4 years ago

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