Depth First Search
1. Which one of the following steps is incorrect when performing DFS?
2. What is the time complexity of DFS? V is the number of vertices & E is the number of edges
3. Pick the incorrect option
4. Which one of the following are applications of DFS?
5. DFS can only be applied on Trees & not on Graphs.
6. Pick the incorrect option
7.
When we apply DFS on the above graph, which one of the following order of traversal is not possible?
When we apply DFS on the above graph, which one of the following order of traversal is not possible?