欢迎来到天天文库
浏览记录
ID:40634764
大小:26.38 KB
页数:4页
时间:2019-08-05
《可拓层次分析法的JAVA实现》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库。
1、packagecom.util;importjava.util.ArrayList;/****@authorAhua**/publicclassWZ{privateArrayListminU=newArrayList();//判断矩阵集合下限,每个数组对应一行privateArrayListmaxU=newArrayList();//判断矩阵集合上限,每个数组对应一行privateArrayListW=newAr
2、rayList();//权重privateArrayListminapqs=newArrayList();privateArrayListmaxapqs=newArrayList();privateArrayListminX=newArrayList();privateArrayListmaxX=newArrayList();privateArrayList3、ble>minaij=newArrayList();privateArrayListmaxaij=newArrayList();privateDoublek;privateDoublem;privateArrayListmins;privateArrayListmaxs;privateArrayListsub;//maxs-minsprivateArrayListresults;publicArr4、ayListgetW(ArrayListminu,ArrayListmaxu){this.minU=minu;this.maxU=maxu;//for(inti=0;i5、axapqs=getApqs(maxU);//for(inti=0;i6、tX(minapqs);//归一化//for(inti=0;i7、getK(maxaij);//System.out.println(k+","+m);if(0<=k&&k<=1){if(1<=m){mins=getS(k,minX);maxs=getS(m,maxX);//for(inti=0;i8、(i)+",a");//}results=getResults(mins,maxs,sub);//for(inti=0;i
3、ble>minaij=newArrayList();privateArrayListmaxaij=newArrayList();privateDoublek;privateDoublem;privateArrayListmins;privateArrayListmaxs;privateArrayListsub;//maxs-minsprivateArrayListresults;publicArr
4、ayListgetW(ArrayListminu,ArrayListmaxu){this.minU=minu;this.maxU=maxu;//for(inti=0;i5、axapqs=getApqs(maxU);//for(inti=0;i6、tX(minapqs);//归一化//for(inti=0;i7、getK(maxaij);//System.out.println(k+","+m);if(0<=k&&k<=1){if(1<=m){mins=getS(k,minX);maxs=getS(m,maxX);//for(inti=0;i8、(i)+",a");//}results=getResults(mins,maxs,sub);//for(inti=0;i
5、axapqs=getApqs(maxU);//for(inti=0;i6、tX(minapqs);//归一化//for(inti=0;i7、getK(maxaij);//System.out.println(k+","+m);if(0<=k&&k<=1){if(1<=m){mins=getS(k,minX);maxs=getS(m,maxX);//for(inti=0;i8、(i)+",a");//}results=getResults(mins,maxs,sub);//for(inti=0;i
6、tX(minapqs);//归一化//for(inti=0;i7、getK(maxaij);//System.out.println(k+","+m);if(0<=k&&k<=1){if(1<=m){mins=getS(k,minX);maxs=getS(m,maxX);//for(inti=0;i8、(i)+",a");//}results=getResults(mins,maxs,sub);//for(inti=0;i
7、getK(maxaij);//System.out.println(k+","+m);if(0<=k&&k<=1){if(1<=m){mins=getS(k,minX);maxs=getS(m,maxX);//for(inti=0;i8、(i)+",a");//}results=getResults(mins,maxs,sub);//for(inti=0;i
8、(i)+",a");//}results=getResults(mins,maxs,sub);//for(inti=0;i
此文档下载收益归作者所有