BFS专题

BFS专题

 

题目编号	OJ编号	题目名称	题解链接
Problem A	HDU 1548	A strange lift	http://www.cnblogs.com/ohyee/p/5389459.html
Problem B	HDU 1372	Knight Moves	http://www.cnblogs.com/ohyee/p/5389471.html
Problem C	HDU 2717	Catch That Cow	http://www.cnblogs.com/ohyee/p/5389479.html
Problem D	POJ 1324	Holedox Moving
Problem E	HDU 1026	Ignatius and the Princess I	http://www.cnblogs.com/ohyee/p/5410118.html
Problem F	HDU 1072	Nightmare	http://www.cnblogs.com/ohyee/p/5393803.html
Problem G	HDU 1073	Online Judge
Problem H	HDU 1175	连连看	http://www.cnblogs.com/ohyee/p/5399960.html
Problem I	HDU 1180	诡异的楼梯	http://www.cnblogs.com/ohyee/p/5409975.html
Problem J	HDU 1242	Rescue	http://www.cnblogs.com/ohyee/p/5415119.html
Problem K	HDU 1728	逃离迷宫	http://www.cnblogs.com/ohyee/p/5416101.html
Problem L	HDU 2579	Dating with girls(2)	http://www.cnblogs.com/ohyee/p/5416826.html
Problem M	HDU 2102	A计划	http://www.cnblogs.com/ohyee/p/5417097.html
Problem N	HDU 1253	胜利大逃亡	http://www.cnblogs.com/ohyee/p/5421606.html
Problem O	HDU 1240	Asteroids!	http://www.cnblogs.com/ohyee/p/5428109.html
Problem P	HDU 1429	胜利大逃亡(续)	http://www.cnblogs.com/ohyee/p/5423509.html
Problem Q	HDU 1254	推箱子
Problem R	HDU 2612	Find a way	http://www.cnblogs.com/ohyee/p/5428273.html
Problem S	HDU 1983	Kaitou Kid - The Phantom Thief (2)
Problem T	HDU 1195	Open the Lock	http://www.cnblogs.com/ohyee/p/5428649.html
Problem U	HDU 2128	Tempter of the Bone II

 

BFS(宽度优先遍历 或 广度优先遍历)是一种从起点开始，逐层向外拓展的算法。

采用队列或优先队列来保证逐层的特性。

当第一次访问到终点时，即得到最短路径