589,114 views 601 on YTPak
2,214 139

Published on 17 Feb 2013 | over 4 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.
Customize Your Hybrid Embed Video Player!

6-digit hexadecimal color code without # symbol.

 

Report video function is under development.

 


Loading related videos...