Breadth-first search: Difference between revisions

Revision as of 02:55, 29 May 2005

Revision as of 02:04, 6 June 2005

Line 18:

a breadth-first search starting at A, and assuming that the left edges in the shown graph are chosen before right edges, will result in the search visiting the nodes in the following order: A, B, C, E, D, F, G. Compare with [[depth-first search]].

==Pseudocode==

{{wikicode}}