Multiple Choice
The only difference between a depth-first traversal of a graph and a breadth-first traversal is the use of a _________ instead of a queue to manage the traversal.
A) Stack
B) Tree
C) List
D) Heap
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q27: What is a directed graph?
Q28: A path in a directed graph is
Q29: Two vertices in a graph are _
Q30: An undirected graph is a graph where
Q31: A path in a directed graph is
Q33: The only difference between a depth-first traversal
Q34: A minimum spanning tree is a spanning
Q35: An undirected graph is a graph where
Q36: A minimum spanning tree is a spanning
Q37: What is the difference between a graph