Shot in the Dark: Minimum-weight perfect matching algorithm
David Eppstein
eppstein at ics.uci.edu
Fri Mar 15 21:35:04 EST 2002
In article <pan.2002.03.15.19.52.32.366019.81993 at snet.net>,
Paul Magwene <p.magwene at snet.net> wrote:
> Does anybody happen to have a Python implementation of a minimum-weight
> perfect matching algorithm? Or a Python interface to one?
>
> I'm aware of (some) of the literature on this topic, but as a non-computer
> scientist I'd rather not have to twist my mind around one of the Blossum
> algorithms.
I take it you need nonbipartite perfect matching?
Bipartite is much easier. (I don't have Python even for that, but I do
have some simple C code...)
--
David Eppstein UC Irvine Dept. of Information & Computer Science
eppstein at ics.uci.edu http://www.ics.uci.edu/~eppstein/
More information about the Python-list
mailing list