Can anyone say how to solve this problem.It was asked in flipkart online test.
Given a weighted undirected graph, you have to find the shortest distance between source and destination given you can remove k edges from the path.
3 Likes