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...
Class string has member function __________ to interchange the data stored in two string objects
a. exchange b. switch c. swap d. copyto
When you enter the parameter value prompt as a criterion in Design view, Access assumes you want users to enter a value with the ____ data type.
A. Short Text B. Memo C. Hyperlink D. Number
In a(n) ____ loop the condition the tested condition does not depend on a count being achieved, but rather on a specific value being encountered.
A. pretest B. posttest C. fixed-count D. condition-controlled
A technician is plugging in an external HDD. Which of the following connections should the technician use to ensure the HIGHEST transfer rate?
A. USB 1.1 B. USB 2.0 C. IEEE 1394b D. eSATA