Q: What is the time complexity of a depth-first search (DFS) algorithm on a graph with V vertices and E edges?  

Answer: D

Explanation:

Related Topic:

---

Share Above MCQ