1 votes 1 votes Algorithms gateforum-test-series + – Mk Utkarsh asked Nov 10, 2017 Mk Utkarsh 482 views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments Mk Utkarsh commented Nov 10, 2017 reply Follow Share Ohh how can i forget how DFS works. Thanks :) 0 votes 0 votes Shubhanshu commented Nov 10, 2017 reply Follow Share Thanks to all.!!! So conclusion is that after traversing one entire component then only we can move to any other component. and this process continued untill all vertices of the given graph are traversed. ryt.?? 0 votes 0 votes Anu007 commented Nov 10, 2017 reply Follow Share Yes . One simple analogy Decision to visit next node only depend on a present node, not the previous node. 0 votes 0 votes Please log in or register to add a comment.