Breadth-first search: Difference between revisions

Revision as of 16:58, 16 June 2005

Revision as of 16:01, 21 June 2005

Line 21:

'''function''' breadthFirstSearch (Start, Goal) {

pushenqueue(Queue,Start)

'''while''' notEmpty(Queue)) {

Node := popdequeue(Queue)

'''if''' Node = Goal {

return Node

Line 30:

'''if''' notVisited(Child) {

setVisited(Child)

pushenqueue(Queue, Child)

}

}