Can anyone prove it? Coding Ninjas Studio .
We will be given an undirected graph, and we have to find the shortest cyclic path that will visit all the vertices or edges of the graph at least once.
Why have we added the minimum odd pair sum?
Also, If possible explain this problem solution with a randomized matching algorithm.
Thanks.