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

#includeiostream #includequeue #includefstream using namespace std; //import the grid data; ifstream fin(map.txt);//这个map是7行7列，请以这个为例子来理解这个程序 typedef struct Position { int row; int col; } Posi; //find the shortest path for the grid bool FindPath(Posi start,Posi finish,int PathLen,int **grid,Posi * path,int n,int m) { //if the start position is the finish position if((start.row == finish.row) (start.col == finish.col)) { PathLen = 0; return true; } Position offset[4]; offset[0].row = -1;//up offset[0].col = 0; offset[1].row = 1;//down offset[1].col = 0; offset[2].row = 0;//left offset[2].col = -1; offset[3].row = 0;//right offset[3].col = 1; Posi here,nbr; here.row = start.row; here.col = start.col; int NumOfNbrs = 4;//ajacent position; grid[start.row][start.col] = 2;//init the start positions length with value 2, queuePosi Q; do { for(int firdex = 0;firdex NumOfNbrs;firdex++) { nbr.row = here.row + offset[firdex].row; nbr.col = here.col + offset[firdex].col; if(grid[nbr.row][nbr.col] == 0)//this position havent been visted { grid[nbr.row][nbr.col] = grid[here.row][here.col] + 1; if((nbr.row == finish.row) (nbr.col == finish.col))//find the shortest path { break; } Q.push(nbr); } } if((nbr.row == finish.row) (nbr.col ==finish.col)) { break;//wiring was completed } if(Q.empty())//if queue is empty { return false;//no result } here = Q.front(); Q.pop(); }while(true); //traceback the shortest path PathLen = grid[finish.row][finish.col]-2; path = new Posi[PathLen]; here = finish; for(int firdex = PathLen-1;firdex =0;firdex--) { path[firdex] = here; for(int secdex = 0;secdex NumOfNbrs;secdex++) { nbr.row = here.row + offset[secdex].row; nbr.col = here.col + offset[secdex].col; if(grid[nbr.row][nbr.col] == firdex+2)//It is the nbrs grid that why the grid[nbr.row][nbr.co