Add the code with In-depth explanation of Iterative DFS

[AaliyahBeg]

Related Issue

• Iterative DFS- Graph Traversal Algorithm #1553

Additional Info

• This code has the appropriate explanation of each line in it , thus making it super easy for the reader to understand.

Checklist

• [x] ✅ My code follows the code style of this project.
• [x] 👀 I have read the CONTRIBUTING document.
• [x] ✨ I have added tests to cover my changes.
• [x] 🌟 ed the repo

The Iterative Depth First Search way of traversal in Graphs is a popular graph traversal method used when the graph is nearly linear and has >=10^5 nodes .

If we use Recursive Depth First Search traversal then we will end up getting a stack overflow exception too quick. Thus this is used when Recursive Depth First Search traversal fails.

• [ ] Bug fix (non-breaking change which fixes an issue)
• [x] New feature (non-breaking change which adds functionality)
• [ ] Breaking change (fix or feature that would cause existing functionality to change)

Output Screenshots

Screenshot #1	Screenshot #2
Input	Output

[AaliyahBeg]

Please review my PR @Lakhankumawat

[github-actions[bot]]

This PR is stale because it has been open 3 days with no activity. Please commit the changes requested or make improvements on the code. Thank you for your contributions!