Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!elroy.jpl.nasa.gov!ncar!gatech!purdue!haven!mimsy!nell.cs.umd.edu!benson
From: benson@nell.cs.umd.edu (Gary Benson)
Newsgroups: comp.sources.wanted
Subject: matching program
Message-ID: <31989@mimsy.umd.edu>
Date: 25 Mar 91 18:45:49 GMT
Sender: news@mimsy.umd.edu
Reply-To: benson@nell.cs.umd.edu (Gary Benson)
Distribution: usa
Organization: U of Maryland, Dept. of Computer Science, Coll. Pk., MD 20742
Lines: 9

Does anyone have access to a program that does minimum weight
matching on a general graph?  That is, given a weighted graph,
find a subset of edges such that every node is contained in
exactly one edge and the weight of the set is minimal.

I need a program for this to do some research and I would rather
not rewrite a program if someone else already has it.

Thanks.