Multiple Choice
A depth-first traversal of a graph uses which of the following data structures?
A) binary search tree
B) stack
C) queue
D) array
E) none of the above
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q30: In an undirected graph, an edge of
Q31: What does it mean for a graph
Q32: What is a complete graph? How many
Q33: An undirected graph is connected if for
Q34: What is the difference between a directed
Q36: What is the maximum number of edges
Q37: A digraph is a _ .<br>A) graph
Q38: Write out all of the edges in
Q39: In graph terminology, the nodes are referred
Q40: A graph is said to have a(n)