Register
17. What data structure is used for depth first traversal of a graph.​
24.5k views
19 votes
17. What data structure is used for depth first
traversal of a graph.​

User Leocadiotine
by
3.8k points

1 Answer

2 votes

Answer:

Depth First Search (DFS) algorithm traverses a graph in a depthward motion and uses a stack to remember to get the next vertex to start a search, when a dead end occurs in any iteration.anation:

User BrooklynSon
by
3.7k points
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

4.5m questions

5.8m answers

Other Questions

Assume you have created a mechanical arm that can hold a pen. The arm can perform the following tasks: • Lower the pen to a piece of paper. • Raise the pen from the paper. • Move the pen 1 inch along a
Drag each connector name to match the connector type shown.
In which part is data processing done?
What is the maximum throughput of a homogeneous pipeline in which four processors each handle one million instructions per second and processing a data item requires 50, 60, 40, and 30 instructions, respectively?
What problem does chlorofluorocarbon (CFC) create? a. it causes lead poisoning b.it causes great damage to the ozone layer c. it leaks into food as it cools the air and refrigerators d. it is responsible
Link Copied!