Inscrit le: 22 Juin 2018
|Posté le: Mar 10 Juil - 04:55 (2018) Sujet du message: Could anyone tell me efficient algorithm to solve this??
Could anyone tell me efficient algorithm to solve this problem ?
For given graph find minimum cost of edges (and print this edges), which must be eliminated from graph, in such way, that graph split to two parts.
In problem says that one part must contains vertex 1, and second - vertex 2, but I think, that it's not important which vertex is in which part of graph.
Maybe someone tell me name of this algorithm or give me a link to implementation or site with more information about it ?
I didn't find the right solution from the internet.
Brand Video Company