QWhat is the time complexity of Breadth First Search (BFS) on a graph with V vertices and E edges?

Choose the Best Option

Click any option to instantly check if you're correct.

• A O(V+E) ✔ ✖
• B O(V^2) ✔ ✖
• C O(E^2) ✔ ✖
• D O(log V) ✔ ✖

Share This Question

Challenge a friend or share with your study group.

Related MCQ Questions