On Mon, May 16, 2011 at 12:18 AM, Gael Varoquaux <gael.varoqu...@normalesup.org> wrote: > Following a suggestion by Joseph, I am trying to implement the > Jonker-Volgenant algorithm for best linear assignment in Python, using > numpy. Unsuprisingly, it is proving time-costly. I cannot afford to spend > too much time on this, as it not to solve a problem of mine, but for the > scikits.learn. Thus I was wondering if someone had a BSD-licensed Python > version of the algorithm that he would be willing to share.
There are a number available. The lemon graph library (http://lemon.cs.elte.hu/trac/lemon) has solvers for this problem and has python bindings. It's under the boost license (is that ok?). It might be a bit heavyweight for this, though, but it's great software. -- Hoyt ++++++++++++++++++++++++++++++++++++++++++++++++ + Hoyt Koepke + University of Washington Department of Statistics + http://www.stat.washington.edu/~hoytak/ + hoy...@gmail.com ++++++++++++++++++++++++++++++++++++++++++ _______________________________________________ NumPy-Discussion mailing list NumPy-Discussion@scipy.org http://mail.scipy.org/mailman/listinfo/numpy-discussion
