test.java

java编写的最短路径算法

package engine;



import integrate.*;
public class Test {
	public Structure finalInput;
	public Structure finalOutput;
	public GeneralMethod test;
	public Test(Structure ff){
		finalInput=ff;
		test = new GeneralMethod(finalInput);
		test.shortestTest();
		test.genAlTest();
		finalOutput=new Structure(finalInput.unitNum);
		finalOutput.unitNum=finalInput.unitNum;
		finalOutput.resultDis=test.optDis;
		for (int i=1; i<finalOutput.unitNum; i++){
			finalOutput.unitList[i]=new Coor();
			finalOutput.unitList[i].layer=test.sPath.xCell[test.genRoute.optimal[i]];
			finalOutput.unitList[i].rank=test.sPath.yCell[test.genRoute.optimal[i]];
		}
		finalOutput.unitList[0]=new Coor();
		finalOutput.unitList[finalOutput.unitNum]=new Coor();
		
		System.out.println("Over");
	}
}