Function that maximizes the shortest path between source and destination vertex by adding a single edge between given selected nodes
def shortestPathCost ( selected , K ) : NEW_LINE INDENT global dist , edges NEW_LINE data = [ ] NEW_LINE DEDENT