mainfunction.java

来自「算法中一个经典问题：背包问题的优先队列算法实现。」· Java 代码 · 共 35 行

import java.util.*;
import java.util.Date;

public class mainFunction {
   public static void main(String[] args) {
       int size=30,maxValue=500,maxWeigh=500;
        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[size];
        Random random=new Random();
        int count=0;
        for(int i=0;i<size;i++)
        {
            data[i]=new node();
            data[i].setId(i);
     //       data[i].setWeigh(init[i][0]);
      //      data[i].setValue(init[i][1]);
            data[i].setValue(random.nextInt(10*size+22));
            data[i].setWeigh(random.nextInt(20*size+2));
            System.out.print(data[i].weigh+","+data[i].value+":");
            count++;
        }
        System.out.println();

        search sch=new search(data,maxWeigh);
        long time1=new Date().getTime();
        sch.best();
        long time2=new Date().getTime();
        long needTime=time2-time1;
 //       sch.result();
        System.out.println("weigh:"+sch.weightemp+",maxvalue:"+sch.maxvalue+",needtime:"+needTime);
        for(int i=0;i<size;i++)
            System.out.print(sch.path[i]+",");
    }
}