Liglogthepanda Posted July 9, 2008 Share Posted July 9, 2008 A question for those familiar with graph theory or the matching type of algorithms: So I have a bipartite graph and I want to perform a maximum matching operation on it. If I call the 'left hand side' "items" and the 'right hand side' "bins", I want to input which items can fit in which bins, and be output with "Item A goes into Bin X, Item B in Bin Y", etc. Obviously I've simplified this. But the PHP will need to include Dijkstra's algorithm somewhere (which I can understand with pen-and-paper but not in code). I can't think of any way to do this ... at all. Help! Quote Link to comment Share on other sites More sharing options...
btherl Posted July 9, 2008 Share Posted July 9, 2008 Have you got a particular data input format and/or data structure in mind? Or is that all yet to be defined? Is maximum weighted bipartite matching the problem you are solving? Quote Link to comment Share on other sites More sharing options...
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.