java 程序提问

来源：百度知道 编辑：UC知道 时间：2024/06/04 12:04:01
import java.io.*;
class find_after_city
{
public int ant_id;
public int next_city_possible_number;
public int city_number;
public int ant_speed;
public int current_city;
public double timeduring;
public int i;
public int ant_number;
public int after_city;
public int bb;
public int bbb;
public int s;
public int m;
public double ran;
public double hormone_total_value;
public int [][] way=new int[ant_number*2][city_number+3];
public int [] possible_city=new int [city_number];
public double [][][] city_link=new double[city_number+1][city_number+1][2];

public find_after_city(int ant_id,int distance_between_two_city,int way[][],int city_number,int ant_speed,int current_city,int i,int number_of_city_ant_has_pass,int goal_last_time,double task_information[][],int ant_number,double timeduring,double city_link[][][],int hormone_of_way,int time_

class find_best_way //继续的提问，代码太长，多次发表
{
double diggest_hormone_road_road_hormone;
int now_city=0;
int final_way[];
int m;
int n;
int pp;
int task_id;
int ni;
int nii;
int city_passed_number;
double total_distance = 0;
int city_number;
double[][][] city_link = new double[city_number + 1][city_number + 1][2];
double[][] task_information = new double[4][6];

public find_best_way(int task_id,int city_number,double city_link[][][],double task_information[][],int distance_between_two_city,int goal_city,int start_city,int task_number,int hormone_of_way)
{
this.final_way[0]=(int)task_information[task_id][start_city];
for(int ni=0;ni<=city_number;ni++)
{
for(int nii=0;nii<=city_number;nii++)
{
this.city_link[ni][nii][0]=city_link[ni][nii][0];
this.city_lin