kacif42316's blog

By kacif42316, history, 6 weeks ago, In English

Hello, I want to find the solution to the problem, where you are given a bipartite graph with n vertices in both the set and n^2 undirected edges with some weight. how to find the minimum cost such that every vertex from both sets is in exactly one pair?

n<=200

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it