【搜索】01_BFS

代码实现逻辑

辅助队列 FIFO

辅助集合 isvisit

①将起始结点加入队列

②循环 当队列非空：

        a.取出front，修改isvisit

        b.将front所有相邻中结点加入队列（排除isvisit过的）

        c.访问front

用途：求最优解

例题1：catch the cow（北大OJ）

【题目描述】

Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,000) on the same number line. Farmer John has two modes of transportation: walking and teleporting.

Walking: FJ can move from any point X to the points X - 1 or X + 1 in a single minute
Teleporting: FJ can move from any point X to the point 2 × X in a single minute.
If the cow, unaware of its pursuit, does not move at all, how long does it take for Farmer John to retrieve it?

Input
Line 1: Two space-separated integers: N and K
Output
Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.
Sample
Input
5 17
Output
4

【题目分析】

#include <cstdio>
#include <queue>
using namespace std;

struct Info{
	int pos;
	int time;
};
int main(){
	int n,k;
	scanf("%d%d",&n,&k);
	queue<Info> posQueue;
	bool isvisit[100001];
	for(int i=0;i<100001;i++){
		isvisit[i] = false;
	}
	
	//把起始点加入队列
	Info first;
	first.pos = n;
	first.time = 0;
	posQueue.push(first);
	
	while(posQueue.empty()==false){
		Info cur = posQueue.front();
		posQueue.pop();
		
		if(cur.pos==k){
			printf("%d\n",cur.time);
			break;
		}
		isvisit[cur.pos] = true;
		
		//将邻居加入到队列中
		Info neighbor;
		if(cur.pos-1 >= 0 && cur.pos-1 <=100000 && isvisit[cur.pos-1] == false){
			neighbor.pos = cur.pos-1;
			neighbor.time = cur.time+1;
			posQueue.push(neighbor);
		} 
		if(cur.pos+1 >= 0 && cur.pos+1 <=100000 && isvisit[cur.pos+1] == false){
			neighbor.pos = cur.pos+1;
			neighbor.time = cur.time+1;
			posQueue.push(neighbor);
		}
		if(cur.pos*2 >= 0 && cur.pos*2 <=100000 && isvisit[cur.pos*2] == false){
			neighbor.pos = cur.pos*2;
			neighbor.time = cur.time+1;
			posQueue.push(neighbor);
		}
	}
}

 例题2：