Breadth Firth Search
Uses
find the shortest path between two nodes in a graph.
have knowledge that a solution is not far from the root of a tree.
prioritize searching vertices that are close to the start node.
visit sibling nodes before child nodes.
Last updated