罗马尼亚度假问题

《罗马尼亚度假问题》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、二、详细代码测试类：/**Main类，打印各个算法的结果*©authordyl**/classMainintresult;intxiabiao[]=null;//访问的下标publicstaticvoidmain(String[]args){Graphgraph=newGraph();System,out.println("罗马尼亚问题");System,out.printlnCl>深度优先搜索");DFSdfs=newDFS();dfs.DFSearch(graph,0,12);System,out.printin(z，2>迭代加深的搜索〃);IDSids=ne

2、wIDS();ids.lDS_Search(graph,0,12,15);//深度设15System,out.printin(〃3、一致代价搜索〃);UCSucs二newUCS(graph,0,12);System,out.println(/z4>A*搜索“);AXingeiXing=ncwAXing();aXing.A_Search(graph,graph.H,0,15);//0-15即Arad到达Hirsova}_/**打印*@paramg:图*@paramstack：栈*/publicvoidshow(Graphg,Stackstack){if(stack.

3、size()==0){System,out.printinf路径搜索失败〃);rcturn;}result-0;System,out.print(z，访问的下标：“);for(inti二0;i〃+st3ck.get(i));}System,out.print(〃访问过程：“);xiabiao二newint[stack,size()];if(stack.isEmpty()){System,out.printin(〃搜索失败");}else{for(inti=0;i

4、e();i++){System,out.print(“-->"+g.cities[(Integer)stack.get(i)]);}for(inti=0;i

5、{0,75,10000,118,140,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000},{75,0,71,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000},{10000,71,0,10000,151,10000,10000,10000,10000,10000,10000,1000

6、0,10000,10000,10000,10000,10000,10000,10000,10000},{11&10000,10000,0,10000,111,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000},{140,10000,151,10000,0,10000,80,99,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000},{10000,10000,

7、10000,111,10000,0,10000,10000,70,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000),{10000,10000,10000,10000,80,10000,0,10000,10000,10000,146,97,10000,10000,10000,10000,10000,10000,10000,10000},{10000,10000,10000,10000,99,10000,10000,0,10000,10000,10000,10000,211,10000

8、,1000