From the course: Python Data Structures and Algorithms
Unlock the full course today
Join today to access over 24,800 courses taught by industry experts.
Challenge: Trace the path of a breadth-first search - Python Tutorial
From the course: Python Data Structures and Algorithms
Challenge: Trace the path of a breadth-first search
(upbeat music) - [Instructor] In this challenge, your task is to calculate the path taken by the breadth-first search algorithm we have studied in the maze shown on the slide. You should do this either on paper or a whiteboard or using the JS app we have provided. Our starting point is (0,0) and the destination is (3,3). Your answer should be in the form of a sequence of ITA coordinates. This challenge should take approximately 8 to 10 minutes to complete.
Practice while you learn with exercise files
Download the files the instructor uses to teach the course. Follow along and learn by watching, listening and practicing.
Contents
-
-
-
-
-
-
-
-
(Locked)
Understand the breadth-first search algorithm3m 1s
-
(Locked)
Visualize breadth-first search in a grid5m 10s
-
(Locked)
Code a breadth-first search in Python6m 39s
-
(Locked)
Challenge: Trace the path of a breadth-first search30s
-
(Locked)
Solution: Trace the path of a breadth-first search37s
-
(Locked)
-
-
-