This is one of the important Graph traversal technique. DFS is based on stack data structure.<br /> <br /> Analysis:<br /> <br /> The time complexity of DFS using Adjacency list is O(V + E) where V & E are the vertices and edges of the graph respectively.<i class="fa fa-language transViewIcon clickable" title="Translation"></i>
View comments