Which of the following statements about graph traversal is false?
A. Depth-first traversal of a graph requires a stack or a recursive algorithm.
B. The breadth-first traversal of a graph requires a queue.
C. A depth-first traversal processes the graph data in key sequence order.
D. Because a vertex can have multiple parents, logic is requires to ensure that each vertex is processed only once.
E. All traversals start at the first vertex of the graph.
Answer: C
You might also like to view...
What is a fiber cross-connect used for?
What will be an ideal response?
Which PHP function can be used to delete an HTTP cookie?
a. delete_cookie() b. rmcookie() c. setcookie() d. remove_cookie()
Describe the most common way a Web client can access Web servers.
What will be an ideal response?
An absolute cell reference remains the same when it is copied or filled to other cells
Indicate whether the statement is true or false