BFS 算法模板
基础模板（最短路径/层级遍历）
function bfs(start, end) { const queue = [start] const visited = new Set([start]) let head = 0 while (head < queue.length) { const cur = queue[head++] // 到达终点 if (cur === end) return true // 遍历邻居 for (const next of getNeighbors(cur)) { if (!visited.has(next)) { visited.add(next) queue.push(next) } } } return false }
带距离/层数模板
function bfs(start, end) { const queue = [[start, 0]] // [节点, 距离] const visited = new Set([start]) let head = 0 while (head < queue.length) { const [cur, dist] = queue[head++] if (cur === end) return dist
