Explanation: Self Explanatory 7. For general graph, how one can get rid of repeated states?
A. By maintaining a list of visited vertices
B. By maintaining a list of traversed edges
C. By maintaining a list of non-visited vertices
D. By maintaining a list of non-traversed edges
Answer:A
Explanation: Self Explanatory 7. For general graph, how one can get rid of repeated states?
A. By maintaining a list of visited vertices B. By maintaining a list of traversed edges C. By maintaining a list of non-visited vertices D. By maintaining a list of non-traversed edges
Explanation: Other techniques are costly. 8. DFS is ______ efficient and BFS is __________ efficient.