• + 1 comment

    For Solving this question here is my submission: 1- Find the adjacency list of compliment of the graph (this will be representing the village roads) 2- Run he BFS with shortest distance

    This is the simplest method in which this problem can be solved