464,725 views 596 on YTPak
1,788 117

Published on 18 Feb 2013 | over 3 years ago

This is one of the important Graph traversal technique. BFS is based on Queue data structure.

Analysis:

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

Loading related videos...