int [ ] function ( int [ ] [ ] arg0 ) { int [ ] loc0 = new int [ nc + nv - 1 ] ; for ( int loc1 = 0 , loc2 = 0 ; loc1 < nv ; loc1 ++ ) { for ( int loc3 = 1 ; loc3 < arg0 [ loc1 ] . length ; loc3 ++ , loc2 ++ ) loc0 [ loc2 ] = arg0 [ loc1 ] [ loc3 ] - 1 ; if ( loc1 != nv - 1 ) { loc0 [ loc2 ] = nc + loc1 ; loc2 ++ ; } } return loc0 ; }
function that converts a solution between matrix representation and array representation concode_field_sep int nc concode_elem_sep int nv concode_elem_sep Tsp tspp concode_elem_sep double[] demands concode_elem_sep double capacity concode_field_sep double total_cost concode_elem_sep double total_cost concode_elem_sep void setNumberClients concode_elem_sep int getNumberClients concode_elem_sep void setTsp concode_elem_sep double[] getDemands concode_elem_sep void setDemands concode_elem_sep Tsp getTsp concode_elem_sep int[][] get_routes concode_elem_sep int getNumberVehicles concode_elem_sep void setNumberVehicles concode_elem_sep void setCapacity concode_elem_sep void setDemand concode_elem_sep double getCapacity concode_elem_sep double getDemand