Get the answers you need at Westonci.ca, where our expert community is dedicated to providing you with accurate information. Connect with a community of professionals ready to provide precise solutions to your questions quickly and accurately. Experience the ease of finding precise answers to your questions from a knowledgeable community of experts.

17. What data structure is used for depth first
traversal of a graph.​

Sagot :

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: