Function that maximizes the shortest path between source and destination vertex by adding a single edge between given selected nodes
void shortestPathCost ( int selected [ ] , int K ) { vector < pair < int , int > > data ;