breadth-first search

views updated

breadth-first search A technique of searching through a tree whereby all nodes in a tree at level k are searched before searching nodes at level k + 1. Compare depth-first search.