Iterative DFS- Graph Traversal Algorithm
AaliyahBeg opened this issue · 7 comments
Description
I would like to add the Iterative Depth First Search way of traversal in Graphs. It's 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.
Domain
Algorithm
Type of Contribution
Addition
Code of Conduct
- I follow Contributing Guidelines & Code of conduct of LearnCPP.
Hello @AaliyahBeg, thanks for creating your first issue at LearnCPP, hope you followed the guidelines.
/assign
This issue has been assigned to AaliyahBeg!
It will become unassigned if it is not closed within 12 days. A maintainer can also add the pinned label to prevent it from being unassigned.
This issue is stale because it has been open 3 days with no activity. Remove stale label or comment or this will be closed in 2 days.
@Lakhankumawat , I am a GSSOC'22 contributor .
I have made the Pull Request.
Can you please review and merge it .
This issue is stale because it has been open 3 days with no activity. Remove stale label or comment or this will be closed in 2 days.
This issue was closed because it has been stalled for 5 days with no activity. Please reopen this issue if not resolved.