Our website is made possible by displaying online advertisements to our visitors. Please consider supporting us by whitelisting our website.

Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)

/ » High Performance Computing (HPC) solved MCQs / By
Question:

Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)

A.

o(v + e)

B.

o(v)

C.

o(e)

D.

o(v*e)

Answer» a. o(v + e)

Note: The above multiple-choice question is for all general and Competitive Exams in India.