Aim

The aim of the Depth-First Search (DFS) technique is to traverse or search through a graph by exploring as far as possible along each branch before backtracking, starting from a given source node.