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 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? Correct Answer Depth First Search
This is the definition of the Depth First Search. Exploring a node, then aggressively finding nodes till it is not able to find any node.
মোঃ আরিফুল ইসলাম
Feb 20, 2025