Multiple Choice
A __________________ traversal can be used to determine if a graph is connected.
A) inorder
B) preorder
C) depth-first
D) breadth-first
E) none of the above
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q11: A breadth-first traversal uses a stack as
Q12: Which of the following describes vertices that
Q13: A connected graph has which of the
Q14: What data structure is used to support
Q15: Is every tree a graph? Is every
Q17: A(n) _ is a two-dimensional array that
Q18: Explain how a breadth-first traversal of a
Q19: Consider the following undirected graph.<br>vertices: 1, 2,
Q20: A spanning tree of a graph does
Q21: A minimum spanning tree of a weighted