Posted On: Feb 22, 2018
Breath-First search involves traversing a binary search tree one level at a time. Starting with the root node, proceeding through neighboring nodes moving towards the next level of nodes. As this process can be performed utilizing FIFO (First in First Out) data structure. This strategy gives the shortest path to the solution. BFS assigns two values to each node: distance and predecessor.
If there is no path from the source node to node “v”, then v's distance is infinite, and it is assumed that predecessor has the same special value as the source's predecessor.
Never Miss an Articles from us.
Basically, machine learning is pattern recognition. Like Youtube’s video recommendations, Facebook’s News Feeds, etc...
Observe and learn from the set of instances and then draw conclusion..