Why is the breath first search algorithm is considered to be the most efficient shortest path algorithm for unweighted graphs?
Please help.
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.