i would like to add Python implementations of two fundamental graph and tree traversal algorithms: Breadth-First Search (BFS) and Depth-First Search (DFS). These algorithms are widely used in various applications like searching, pathfinding, and network analysis.
please assign this to me.
Record
[X] I agree to follow this project's Code of Conduct
[X] I want to work on this issue
[X] I'm willing to provide further clarification or assistance if needed.
Is there an existing issue for this?
Feature Description
i would like to add Python implementations of two fundamental graph and tree traversal algorithms: Breadth-First Search (BFS) and Depth-First Search (DFS). These algorithms are widely used in various applications like searching, pathfinding, and network analysis.
please assign this to me.
Record
Full Name
gauri makhija
Participant Role
contributor