Get Time
Search | Watch Thread  |  My Post History  |  My Watches  |  User Settings
View: Flat (newest first)  | Threaded  | Tree
Previous Thread  |  Next Thread
a matrix solution | Reply
Re: a matrix solution (response to post by nkin) | Reply
One could also use Ford-Fulkerson maximum flow algorithm by adding a source to the front of the bipartite graph and a sink to the back of the bipartite graph to make a runtime complexity closer to linear with respect to the number of edges, but make the algorithm minimize the cost.