find the index in the pairs list for the pair that is furthest apart . concode_field_sep List<Position> starLocations concode_elem_sep LinkedList<LinkedList<Position>> routes concode_elem_sep int[][] heatMap concode_elem_sep Integer numberOfStars concode_elem_sep Integer size concode_elem_sep PathPlanner paths concode_elem_sep int starsLeftToPlace concode_elem_sep char[][] map concode_elem_sep List<Pair> pairs concode_elem_sep PairFinder pairFinder concode_field_sep String getStars concode_elem_sep int distance concode_elem_sep void placeStars concode_elem_sep boolean isValid concode_elem_sep Position findHottestSpotInPaths concode_elem_sep void populateHeatMap concode_elem_sep boolean getCongestionStar concode_elem_sep Position findMaxHeatMap concode_elem_sep boolean getBlockingStar
int function ( ) { Pair loc0 = pairs . get ( 0 ) ; int loc1 = 0 ; for ( int loc2 = 1 ; loc2 < pairs . size ( ) ; loc2 ++ ) { if ( pairs . get ( loc2 ) . distance ( ) > loc0 . distance ( ) ) { loc0 = pairs . get ( loc2 ) ; loc1 = loc2 ; } } return loc1 ; }