分支限界法 求电路布线的最短路径

《分支限界法 求电路布线的最短路径》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、#include#include#includeusingnamespacestd;//importthegriddata;ifstreamfin("map.txt");//这个map是7行7列，请以这个为例子来理解这个程序typedefstructPosition{introw;intcol;}Posi;//findtheshortestpathforthegridboolFindPath(Posistart,Posifinish,int&PathL

2、en,int**&grid,Posi*&path,intn,intm){//ifthestartpositionisthefinishpositionif((start.row==finish.row)&&(start.col==finish.col)){PathLen=0;returntrue;}Positionoffset[4];offset[0].row=-1;//upoffset[0].col=0;offset[1].row=1;//downoffset[1].col=0;offset[2].r

3、ow=0;//leftoffset[2].col=-1;offset[3].row=0;//rightoffset[3].col=1;Posihere,nbr;here.row=start.row;here.col=start.col;intNumOfNbrs=4;//ajacentposition;grid[start.row][start.col]=2;//initthestartposition'slengthwithvalue2,queueQ;do{for(intfirdex=0;f

4、irdex

5、l))//findtheshortestpath{break;}Q.push(nbr);}}if((nbr.row==finish.row)&&(nbr.col==finish.col)){break;//wiringwascompleted}if(Q.empty())//ifqueueisempty{returnfalse;//noresult}here=Q.front();Q.pop();}while(true);//tracebacktheshortestpathPathLen=grid[fini

6、sh.row][finish.col]-2;path=newPosi[PathLen];here=finish;for(intfirdex=PathLen-1;firdex>=0;firdex--){path[firdex]=here;for(intsecdex=0;secdex

7、col]==firdex+2)//Itisthenbr'sgridthatwhythegrid[nbr.row][nbr.col]cangiveindexof"firdex+2"{break;}}here=nbr;//movetothepreviousnode}returntrue;}//allocatememoryforthegridvoidInitGrid(int**&grid,intn,intm){grid=newint*[n+2];for(intfirdex=0;firdex

8、x++)grid[firdex]=newint[m+2];//settheboundfor(intindex=0;index