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