Depth First Search

Depth First Search

Fouad Sabry

Språken
FörlagOne Billion Knowledgeable
ISBN6610000471294

What Is Depth First Search An technique known as depth-first search, or DFS, is used to search or traverse data structures that are organized as trees or graphs. The algorithm makes its way outward from the root node in order to travel as far as it can along each branch before retracing its steps.