Breadth-First Search

From Wiki :-)
Revision as of 05:39, 3 June 2018 by Savoundg (talk | contribs) (Created page with "The Breadth-First Search is an algorithm that finds if there is a path from one node to another. Unlike Depth-First Search, it looks for the neighbours node first before goin...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

The Breadth-First Search is an algorithm that finds if there is a path from one node to another.

Unlike Depth-First Search, it looks for the neighbours node first before going for the children.

Retrieved from "https://wiki.georges.savound.com/index.php?title=Breadth-First_Search&oldid=674"