COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
In the ____ traversal we process all of a vertex’s descendents before we move to an adjacent vertex.
|
|
Depth First
|
|
|
Breadth First
|
|
|
With First
|
|
|
Depth Limited
|
Explanation:
Detailed explanation-1: -Graph traversals Graph traversal means visiting every vertex and edge exactly once in a well-defined order.
Detailed explanation-2: -traversal we process all of a vertex’s descendants before we move to an adjacent vertex | Gkseries.
There is 1 question to complete.