We are given an integer K and a weighted undirected graph with vertices (also refered to as centers) and the distance matrix of the corresponding graph whose values represents the distance between the two centers. 
The task is to find two distinct vertices (centres) which will act as warehouses such that the distance of any center to its closest warehouse is not greater than K. The distance between two centers is the corresponding value in the distance matrix.
