mainfunction.java

用分枝界限法找图的最短路径

package graphic;
import java.util.*;

public class mainFunction {
    public mainFunction() {
    }
    public static void main(String[] args)
    {
        //   String init="1231371481532312410";
        int init[][] = { {1, 2, 3}, {1, 3, 7}, {1, 4, 8}, {1, 5, 3}, {2, 3, 1},
                       {2, 4, 10}, {2, 5, 2}, {3, 4, 2}, {3, 5, 4}, {4, 5, 9}
        };
        final int size=5;Random random=new Random();
        final int arcsnum=10;
        int s=0;
        ArcNode data[]=new ArcNode[arcsnum];
        for(int i=1;i<=size;i++)
           for(int j=i+1;j<=size;j++)
            {
                data[s]=new ArcNode();
                data[s].setPoint1(i);
                data[s].setPoint2(j);
                data[s].setValue(random.nextInt(10));
                s++;

            }
        for(int i=0;i<data.length && data[i]!=null;i++)
           System.out.print(data[i].getPoint1()+","+data[i].getPoint2()+","+data[i].getValue()+"  ");
        find get=new find(size,data);
 //       int[] tempath=new int[size+10];
//        for(int i=0;i<tempath.length;i++)
 //           System.out.print(tempath[i]+" ");
        get.search(1);
        System.out.print("the best path is:");
           for (int i=0;i<get.path.length && get.path[i]!=0;i++)
               System.out.print(get.path[i]+",");
           System.out.println("minsum:"+get.min);

    }
}