👤

Answer :

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:

Go Teaching: Other Questions