A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?
A)bfs
B)dfs
C)prim\s
D)kruskal\s

Question

Quizplus · Accepted Answer

The description matches the Depth-First Search (DFS) algorithm, which explores as far as possible along each branch before backtracking. This is suitable for visiting every vertex in the manner described.

A Person Wants to Visit Some Places