Q.25

Let G=(V,E) be a graph. Let |V|=n and |E|=e. What is the complexity of BFS (breadth first search) as a function of n and e?

A) O( n * e ) B) O( n + e ) C) O( n log( e ) ) D) O( n^2 e )

E) None of the above