电路布线问题C++

{
q=q->next;
}
q->next=t;
return;
}
Position outq()
{
Position out;
out.row=team_l->x;
out.col=team_l->y;
team_l=team_l->next;
return out;
}
void Find_path()
{
Position offset[4];
cout<<"("<<start.row<<","<<start.col<<")";
for(i=0;i<path_len;i++)
{
cout<<"("<<path[i].row<<","<<path[i].col<<")";
}
cout<<endl;
return;
}
void main()
{
Input_data();
{
for(i=0;i<num_of_nbrs;i++)
{
nbr.row=here.row+offset[i].row;
nbr.col=here.col+offset[i].col;
if(a[nbr.row][nbr.col]==0)
{
a[nbr.row][nbr.col]=a[here.row][here.col] + 1;
Position here={start.row,start.col};
Position nbr={0,0};
int num_of_nbrs=4;
int i,j;
offset[0].row=0;offset[0].col=1; //右
offset[1].row=1;offset[1].col=0; //下
cin>>m>>n;
cout<<"请输入开始点坐标(x,y): ";
cin>>start.row>>start.col;
cout<<"请输入结束点坐标(x,y): ";
cin>>end.row>>end.col;
cout<<"区域内是否有被占用点? (y/n) ";
cin>>yes;
while(yes=='y')
Output();
Find_path();
Out_path();
Output();
}
{
cout<<"\n没有结果!!!\n";
return ;
}
here=outq();
}
path_len=a[end.row][end.col];
here=end;
for(j=path_len-1;j>=0;j--)//往回找路径
{
path[j] = here;
for(i = 0;i < num_of_nbrs;i++)
if((nbr.row == end.row) && (nbr.col == end.col))
break;
Inq(nbr); //nbr入队
}
}
if((nbr.row == end.row) && (nbr.col == end.col))//是否到达目标位置finish
break;
if(team_l==NULL)//或节点队列是否为空
{
nbr.row = here.row + offset[i].row;
nbr.col = here.col + offset[i].col;
if(a[nbr.row][nbr.col] == j)
break;
}
here=nbr;
}
return;
}
void Out_path()
{
int i;
cout<<"\n路径为:";
return;
}
void Inq(Position p)
{
TEAM *t,*q;
q=team_l;
t=new TEAM;
t->x=p.row;
t->y=p.col;
t->next=NULL;
if(team_l==NULL)
{
team_l=t;
return ;
}
while(q->next!=NULL)
continue;
}
else
{
a[x][y]=-1;
}
cout<<"是否还有被占用点? (y/n) ";
cin>>yes;
}
for(x=0;x<m+2;x++)
{
a[0][x]=-1;
a[m+1][x]=-1;
}
for(x=0;x<n+2;x++)
{
a[x][0]=-1;
a[x][n+1]=-1;
}
{
cout<<setw(2)<<a[i][j];
}
cout<<endl;
}
cout<<"------------------------------------------------\n";
return;
}
void Input_data()
{
char yes;
int x,y;
cout<<"请输入区域大小(行列的个数): ";
{
cout<<"请输入占用点的坐标(x,y): ";
cin>>x>>y;
if(x<0 || x>m+1 || y<0 || y>n+1 || (x==start.row && y==start.col) || (x==end.row && y==end.col))
{
cout<<"输入错误,请重新输入!!!\n";
TEAM *team_l=NULL;
int a[100][100];
int m,n,path_len;
void Output()
{
int i,j;
cout<<"\n-------------------布线区域图-------------------\n";
for(i=0;i<m+2;i++)
{
for(j=0;j<n+2;j++)
offset[2].row=0;offset[2].col=-1;//左
offset[3].row=-1;offset[3].col=0;//上
if((start.row == end.row)&&(start.col == end.col))
{
path_len =ຫໍສະໝຸດ 0;return;}
while(1)
#include<iostream>
#include<iomanip>
using namespace std;
struct Position
{
int row;
int col;
};
struct TEAM
{
int x;
int y;
TEAM *next;
};
Position start,end,path[100];