Alphonso | Technologist | 10 November

We want to build offices in k new cities. For this project a total of n cities (numbered 1 to n) are under consideration. The n cities are accessible to each other through Flights such that: If there is a direct flight from city A to city B. Then there is a flight from city B to city A It is possible to reach any city Ay from any city Ax by following a unique sequence Ay, Ax+1, ..., Ay ...