search

Saloni6111 / DSA_Problems

Solve given DSA problems here for hactoberfest.
MIT License
32 stars 109 forks source link

Depth-First Search (DFS) #170

Closed MUDITJAINN closed 5 days ago

MUDITJAINN commented 5 days ago

Depth-First Search (DFS) is a graph traversal algorithm used to explore nodes and edges of a graph systematically. It starts at a selected node (often called the "source" or "root") and explores as far as possible along each branch before backtracking.

It is a foundational algorithm in computer science, with numerous applications in various fields, including artificial intelligence, networking, and pathfinding.

MUDITJAINN commented 5 days ago

@Saloni6111 Please Assign this issue to me.

Saloni6111 commented 5 days ago

@MUDITJAINN Merged!