<video><source src="https://csalgo.telegramm.workers.dev/Abdul%20Bari%20DSA%20%F0%9F%A7%A9/22. Graphs/5. Program for BFS.mp4" type="video/mp4"></video> code example
Example: bfs algorithm
function breadthFirstSearch (Start, Goal)
{
enqueue(Queue,Start)
setVisited(start)
while notEmpty(Queue)
{
Node := dequeue(Queue)
if Node = Goal
{
return Node
}
for each Child in Expand(Node)
{
if notVisited(Child)
{
setVisited(Child)
enqueue(Queue, Child)
}
}
}
}