/*
使用广度优先搜索求转机次数最少,不考虑之间距离
*/
#include "stdio.h"
struct note
{
int x;//城市编号
int s;//转机次数
};
int main()
{
struct note que[2501];
int e[51][51] = {0},book[51] = {0};
int head,tail;
int i,j,n,m,a,b,cur,start,end,flag = 0;
scanf("%d %d %d %d",&n,&m,&start,&end);
//初始化二维矩阵
for(i = 1;i <= n;i++)
{
for(j = 1;j <= n;j++)
{
if(i == j)
{
e[i][j] = 0;
}
else
{
e[i][j] = 99999999;//我们这里假设99999999为正无穷大
}
}
}
//城市之间的航班
for(i = 1;i <= m;i++)
{
<