@Raja Rawal i think it is trying to say that each step we exhange distance vector and since while exchanging distance vector we find the shortest path between two router .so finally get an optimal cost for covering each router.
1st step->distance containing one edges. 2nd step-> distance containing atmost 2 edges 3rd step and so .
