AlgoMaster Logo

Depth First Search (Iterative)

graph=[[1,2],[3,4],[5],[5],[5],[]],startNode=0
0 / 22
visited:F0F1F2F3F4F5012345startStackNot visitedIn stackVisitedCurrentResult: []
algomaster.io
Step:Start DFS from node 0 using stack