Breadth-First Search: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 4: | Line 4: | ||
The algorithm uses queues to get the list of children of the node's neighbours to visit then is the correct order. | The algorithm uses queues to get the list of children of the node's neighbours to visit then is the correct order. | ||
BFS is generally better if we want to find the shortest path in a graph. | |||
== Resources == | == Resources == | ||
Revision as of 13:56, 30 September 2020
The Breadth-First Search is an iterative 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.
The algorithm uses queues to get the list of children of the node's neighbours to visit then is the correct order.
BFS is generally better if we want to find the shortest path in a graph.
Resources
| https://en.wikipedia.org/wiki/Breadth-first_search |