Why is the breath first search algorithm is considered to be the most efficient shortest path algorithm for unweighted graphs?
Please help.
Printable View
Why is the breath first search algorithm is considered to be the most efficient shortest path algorithm for unweighted graphs?
Please help.
I bet google and wikipedia know the answer
http://en.wikipedia.org/wiki/Breadth-first_search
Near the bottom
anyone else knows the answer? Please help. I am a noob in this field.
Probably because it uses a local greedy algorithm. I only know of the Depth-first search besides this one (for non-negative graphs), but it uses backtracking, which obviously is slower.