Implement DFS in C++
Algorithm/Data Structure: Depth-First Search (DFS) Programming Language: C++ Difficulty: ⭐️⭐️⭐️
Issue Details
Description: Implement the Depth-First Search (DFS) algorithm in C++. DFS is a fundamental graph traversal algorithm that explores as far as possible along each branch before backtracking. Your implementation should correctly traverse a graph starting from a specified source vertex, and return the visited vertices in the order they were visited.
Additional Information: If you are new to DFS or need guidance on implementing it in C++, feel free to ask questions or seek help in the comments. This is a great opportunity for contributors to gain experience in graph algorithms in C++.
Note: Before starting to work on this issue, please comment below to express your interest and let us know if you have any questions or need clarification on the task.
Please assign me this issue.
Hey @Soyamprabha, Assigned the issue to you, you can now start working on this.
I have sent the PR
Sir can you please review the PR and let me know if any changes are required? And if not, can it be merged?