广度优先算法（BFS）

#include"iostream"
#include<queue>
using namespace std;

const int N = 4;
int MaxDist = 100000;
int map[N][N];
int Dist[N];

struct Node{
	int x;
	int y;
};

int BFS(int v)//v:源点,w:目的点,n:顶点数
{
	int i,j;
	int u;
	int count = 0;
	bool Visited[N];
	Node node;
	queue<int>Q;
	memset(map,MaxDist,sizeof(N));//初始化地图全部为0
	//InitQueue(Q);
	Q.push(v);

	for(i = 0; i < N; i++)
	{
		Visited[i] = false;
		Dist[i] = map[1][i];
	}

	while(!Q.empty())
	{
		u = Q.front();
		Dist[u] = 0;

		Visited[u] = true;
		Q.pop();
		for(j = 0; j < N; j++)
		{
			if((Dist[j] == MaxDist) && (!Visited[j]))
			{
				Dist[j] = ++count;
				Q.push(j);
			}
		}
	}//while
	return 0;
}

int main()
{
	int i,j,k;
	cout<<"Please in put the path:"<<endl;
	for(k = 0; k < N; k++)
	{
		cin>>i>>j;
		map[i][j] = 1;
	}

	BFS(1);
}