Implement DFS in Python

[sobhanbera]

Algorithm/Data Structure: Depth-First Search (DFS)
Programming Language: Python
Difficulty: ⭐️⭐️⭐️

Issue Details

Description:
Implement the Depth-First Search (DFS) algorithm in Python. 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 Python, 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 Python.

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.

[shohan2001]

Can you assign this to me?

[sobhanbera]

@shohan2001 assigned this issue to you. let me know if you need any help!

[shohan2001]

I have created a PR #207, can you please review it.