This is one of the important Graph traversal technique. DFS is based on stack data structure.

Analysis:

The time complexity of DFS using Adjacency list is O(V + E) where V & E are the vertices and edges of the graph respectively.