432,484 views 559 on YTPak
1,493 81

Published on 17 Feb 2013 | over 3 years ago

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.

Loading related videos...