mainfunction.java

找算法中一个经典问题：找最短哈米尔顿回路的算法实现。

import java.util.Date;
import java.util.Random;

public class mainFunction {
    public mainFunction() {
    }
    public static void main(String[] args)
    {
        int size=100,maxValue=500,maxWeigh=50;
        int init[][]={{5,8},{8,7},{10,6},{20,20},{9,7},{15,3},{17,20},{4,8},{3,30},{1,5}};
        node[] data=new node[init.length];
        Random random=new Random();
        int count=0;
        for(int i=0;i<init.length;i++)
        {
            data[i]=new node();
            data[i].setId(i);
    //        data[i].setValue(random.nextInt(10*size+22));
    //        data[i].setWeigh(random.nextInt(20*size+2));

    data[i].setWeigh(init[i][0]);
    data[i].setValue(init[i][1]);
            System.out.print(data[i].weigh+","+data[i].value+":");
            count++;
        }

        choose chs=new choose(data,maxValue,maxWeigh);
        long time1=new Date().getTime();
        chs.switching(0);
        long time2=new Date().getTime();
        for(int i=0;i<chs.bestchos.length;i++)
            System.out.print(chs.bestchos[i]+",");
        System.out.println("maxweigh:"+chs.maxtempweigh+ ",maxvalue:"+chs.maxtemp+",need time: "+(time2-time1));
    }
}