广度优先搜索算法

最新推荐文章于 2025-07-30 14:22:39 发布
最新推荐文章于 2025-07-30 14:22:39 发布
阅读量74 收藏 1
点赞数
CC 4.0 BY-SA版权
文章标签： 算法 C C++ C# J#
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.youkuaiyun.com/jsrookie/article/details/83839604 
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<title>8方向双向广搜</title>
</head>

<body>
<script type="text/javascript">
var tb = [], o, r, c, n=0, newHash;
var dir=[ [-1,0], [1,0], [0,-1], [0,1], [-1,-1], [1,1], [1,-1], [-1,1] ];
function sou(hash){
	newHash = {};
	for(var i in hash){
		for(var j=0; j<8; j++){
			r = hash[i].row + dir[j][0];
			c = hash[i].col + dir[j][1];
			if(r<0||c<0||r==rows||c==cols||tb[r][c].tp==1||tb[r][c].tp==hash[i].tp) continue;
			o = tb[r][c];
			if(o.tp!=0) {alert(new Date()-time);return show(o)(hash[i]);}
			o.parent = hash[i];
			o.tp = o.parent.tp;
			//o.obj.style.backgroundColor = "#CC66FF";
			newHash[r+"."+c] = o;
		}
	}
	//alert("第"+(++n)+"步");
	sou(newHash);
}
function show(o){
	if(!o.parent) return show;
	o.obj.style.backgroundColor = "yellow";
	return show(o.parent);
}

var mapArr = [
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,1,1,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,1,1,1,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,1,1,1,0,0,0,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,1,0,1,0,0,0,0,0,1,0,1,1,1,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,1,1,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0,1,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,1,0,1,0,0,1,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,1,0,1,0,0,1,1,1,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,1,1,1,0,1,0,0,0,0,0,1,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,1,0,0,0,0,1,0,1,1,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0],
[0,0,0,0,1,0,0,0,0,0,2,0,1,0,0,1,0,1,0,0,1,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0],
[0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,1,0,0,1,0,1,0,0,0,0,0,0,0,1,1,1,1,1,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0],
[0,0,0,0,1,1,1,1,1,1,1,1,1,0,0,1,0,1,0,0,1,0,1,0,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,1,0,0,1,0,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,1,0,1,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,1,0,0,0,1,1,0,0,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,1,0,0,1,0,1,0,0,0,0,0,3,0,1,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,1,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,1,0,1,1,1,1,1,1,1,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
];

var rows = mapArr.length+2;
var cols = mapArr[0].length+2;
var hash={};
for(r=0; r<rows; r++){
	tb[r] = [];
	for(c=0; c<cols; c++){
		o = {row:r, col:c};
		o.tp = r>0&&c>0&&r<rows-1&&c<cols-1 ? mapArr[r-1][c-1] : 1;
		var bg = "blue";
		switch(o.tp){
			case 1: bg = "red"; break;
			case 2: bg = "green"; hash[r+"."+c]=o; break;
			case 3: bg = "black"; hash[r+"."+c]=o; break;
		}
		o.obj = document.createElement("img");
		o.obj.style.cssText = "position:absolute; left:"+c*10+"px; top:"+r*10+"px; background-color:"+bg+"; width:10px; height:10px;";
		this.tb[r][c] = o;
		document.body.appendChild(o.obj);
	}
}
document.write('<input style="position:absolute;top:'+(rows*10+20)+'px" type="button" value="查找路径" onclick="time=new Date();sou(hash)" />')
</script>
</body>
</html>

 

http://bbs.51js.com/viewthread.php?tid=86484&extra=page%3D3

jsrookie
关注
广度优先搜索算法带图详解
m0_54615144的博客
07-27 1万+
常常我们有这样一个问题，从一个起点开始要到一个终点，我们要找寻一条最短的路径，从图2-1举例，如果我们要求V0到V6的一条最短路（假设走一个节点按一步来算）
C语言实现广度优先搜索算法
2301_79326930的博客
09-05 582
广度优先搜索（BFS）是一种常用的图搜索算法，用于在图或树数据结构中找到从起点到目标节点的最短路径。通过以上的代码示例，你可以理解BFS算法的实现原理，并在自己的程序中应用该算法进行图搜索。函数实现了BFS算法的核心逻辑，通过循环遍历队列中的节点，并将其未访问的邻接节点加入队列，直到找到目标节点或遍历完整个图。BFS算法的基本思想是从起点开始，逐层地探索与当前节点相邻的节点，直到找到目标节点或遍历完整个图。函数中，我们首先从用户输入中获取图的节点数和边数，然后逐个添加边。函数将节点加入队列，
宽度优先搜索算法
weixin_43694660的博客
07-12 709
其中有一些人相互认识，现在 x 想要认识 y，可以通过他所认识的人来认识更多的人（如果 a 认识 b、b 认识 c，那么 a 可以通过 b 来认识 c），求出 x 最少需要通过多少人才能认识 y。以下为一个 w 行 h 列的二维字符矩阵，每个字符为“.”“#”“@”，分别表示该位置为黑色的瓷砖、红色的瓷砖、小林的初始位置。对于以上“无向图”，从顶点 V0 开始进行宽度优先搜索，得到的一个序列为 V0，V1，V2，V3，V4，V6，V5。【输出格式】 输出一行一个数，表示 x 认识 y 最少需要通过的人数。
【算法】浅析广度优先搜索算法
Young_Pro的博客
08-04 1271
广度优先搜索是一种先访问最近的节点，再逐渐向外扩展的算法。广度优先搜索算法作为一种有效的搜索策略，在图论和相关领域有着广泛的应用。通过本文的介绍，相信大家对BFS的原理、实现和应用有了更深入的认识。在实际问题求解过程中，我们可以根据问题的特点，合理选择和运用BFS，以有效地解决问题。
宽度优先搜索算法（BFS）详解（超级详细讲解，附有大图）
热门推荐
aliyonghang的博客
01-18 5万+
​ 补充说明：由上可以知道，广度优先搜索的特征为从起点开始，由近及远进行广泛的搜索。因此，目标顶点离起点越近，搜索结束得就越快。 三.对比与发现 DFS和BFS的区别 bfs 遍历节点是先进先出，dfs遍历节点是先进后出； bfs是按层次访问的，dfs 是按照一个路径一直访问到底，当前节点没有未访问的邻居节点时，然后回溯到上一个节点，不断的尝试，直到访问到目标节点或所有节点都已访问。 bfs 适用于求源点与目标节点距离最近的情况，例如：求最短路径。dfs 更适合于求解一个任意符合方案中的一个或者遍历所有情
广度优先搜索算法（BFS）
2401_89146275的博客
04-07 323
本篇文章介绍了广度优先搜索算法，帮助大家找出最短路径。
Python实现 宽度/广度优先搜索算法, 深度优先搜索算法
weixin_44065078的博客
10-28 2875
Python实现 宽度/广度优先搜索算法, 深度优先搜索算法1. 二叉树图2. 宽度/广度优先搜索算法(Breadth First Search，BSF)3. 深度优先搜索算法4. 宽度/广度优先搜索算法实现5. 深度优先搜索算法实现6. 完整代码实现 1. 二叉树图 2. 宽度/广度优先搜索算法(Breadth First Search，BSF) 工作原理: 从图中某顶点v出发，首先访问定点v 在访问了v之后依次访问v的各个未曾访问过的邻接点； 然后分别从这些邻接点出发依次访问它们的邻接点，并使得“
C++之广度优先搜索算法篇
一个不懂编程的编程大佬，当一个人面对疾风，走上前去当一个逆行者，才是卫国黑客（AI终将代替人类）
06-30 963
【代码】C++之广度优先搜索算法篇。
宽度优先搜索算法（BFS）
2301_76161469的博客
03-10 4008
先从左向右，再从右向左地对每一层节点进行遍历以示例1为例：即。
MATLAB源码集锦-基于BFS广度优先搜索算法代码
02-14
本资源“MATLAB源码集锦-基于BFS广度优先搜索算法代码”是专门为MATLAB用户提供的，旨在帮助他们理解和实现BFS算法。 BFS算法的基本思想是从起点开始，首先访问其所有邻居，然后访问这些邻居的邻居，以此类推，直到...
C语言使用广度优先搜索算法解决迷宫问题（队列）
01-01
本文实例讲述了C语言使用广度优先搜索算法解决迷宫问题。分享给大家供大家参考，具体如下： 变量 head 和 tail 是队头和队尾指针， head 总是指向队头， tail 总是指向队尾的下一个元素。每个点的 predecessor 成员...
宽度优先搜索 算法.doc
06-09
采用宽度优先搜索算法，编程实现八数码问题的求解。初始状态和目标状态可自定；采用宽度优先搜索算法，编程实现八数码问题的求解。初始状态和目标状态可自定采用宽度优先搜索算法，编程实现八数码问题的求解。初始...
搜索算法_广度优先搜索算法判断图的连通性_matlab
04-02
资源名：搜索算法_广度优先搜索算法判断图的连通性_matlab 资源类型：matlab项目全套源码 源码说明： 全部项目源码都是经过测试校正后百分百成功运行的，如果您下载后不能运行可联系我进行指导或者更换。 适合人群：...
今日十题：56. 合并区间
最新发布
qq_59259601的博客
07-30 50
解法：先排序（贪心）思想;首先给intervals的所有区间按照区间起点进行排序以第一个区间的左顶点和右顶点为起点和终点{start,end}然后从第二个区间开始遍历，如果有重叠就更新end否则将区间放入结果集，并且更新起点和终点遍历完所有数组，将最后一个区间放入结果集时间复杂度O(nlogn)
#C语言——学习攻略：深挖指针路线（三）--数组与指针的结合、冒泡排序
2501_91617454的博客
07-29 802
本文主要讲解了C语言中数组与指针的关系及应用。首先指出数组名在多数情况下代表首元素地址，但sizeof(数组名)和&数组名例外，前者计算整个数组大小，后者获取整个数组地址。接着介绍了用指针访问数组的方法，说明arr[i]、*(arr+i)和p[i]的等价性。然后分析了一维数组传参的本质是传递指针，因此在函数内部无法通过sizeof计算数组长度。此外，文章还讲解了冒泡排序的实现、二级指针的概念，以及如何使用指针数组模拟二维数组。这些内容有助于深入理解指针与数组的关系及其灵活应用。
求两数之和
silent702366的博客
07-28 124
给定一个整数数组 nums 和一个整数目标值 target，请你在该数组中找出 和为目标值 target 的那 两个 整数，并返回它们的数组下标。
算法【1】
weixin_47868976的博客
07-29 919
有一堆石头，用整数数组 stones 表示。其中 stones[i] 表示第 i 块石头的重量。每一回合，从中选出任意两块石头，然后将它们一起粉碎。假设石头的重量分别为 x 和 y，且 x <= y。那么粉碎的可能结果如下：如果 x == y，那么两块石头都会被完全粉碎；如果 x!= y，那么重量为 x 的石头将会完全粉碎，而重量为 y 的石头新重量为 y-x。最后，最多只会剩下一块 石头。返回此石头 最小的可能重量。如果没有石头剩下，就返回 0。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值