[Boost-users] [BGL] Two Grpah Matching Algorithms

From: Hossein Haeri (powerprogman_at_[hidden])
Date: 2006-06-26 11:45:42

Dear all,

(I don't know whether I'm supposed to post BGL stuff
to a more specialised list. Am I?)

I was wondering if anybody here has implemented the
maximum weight graph matching algorithm for bipartite
graphs. Is that already a part of BGL? And, what about
the stable marriage algorithm?

To stop people from lynching me, this is NOT an
assignement; We [1] are running out of time for a
paper submission, and, we still need a few more
evaluations. That's why I'm in a hurry... So, what I
need for the moment is an implementation of the above
two algorithms. Any help in this respct would be
highly appriciated.

TIA,
--Hossein

[1] Semantic Web Research Laboratory,
Computer Engineering Department,
Sharif University of Technology (SUT),
Tehran, IRAN.
http://sw.ce.sharif.edu

                
___________________________________________________________ 
Try the all-new Yahoo! Mail. "The New Version is radically easier to use" – The Wall Street Journal 
http://uk.docs.yahoo.com/nowyoucan.html