Skip main navigation

Graph traversal complexity

In this video, Shubham Sarda, from Unwired Learning, explores the complexities of breadth-first (BFS) and depth-first (DFS) searching.

In this video, you’ll explore the complexities of graph traversal.

You will learn more about the time and space complexity of DFS and BFS.

This article is from the free online

Computer Science Essentials: Algorithms

Created by
FutureLearn - Learning For Life

Our purpose is to transform access to education.

We offer a diverse selection of courses from leading universities and cultural institutions from around the world. These are delivered one step at a time, and are accessible on mobile, tablet and desktop, so you can fit learning around your life.

We believe learning should be an enjoyable, social experience, so our courses offer the opportunity to discuss what you’re learning with others as you go, helping you make fresh discoveries and form new ideas.
You can unlock new opportunities with unlimited access to hundreds of online short courses for a year by subscribing to our Unlimited package. Build your knowledge with top universities and organisations.

Learn more about how FutureLearn is transforming access to education