Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.Congratulations | Improve Your Code
Breadth First Search
course content

Course Content

Breadth First Search

Breadth First Search

1. What is BFS
How to SearchGraph Class Implementation
2. Practice
Breadth First TraverseCheck if is One ComponentShortest Path in GraphRestoring Shortest PathFind All Connected ComponentsIs a Tree
3. Improve Your Code
CongratulationsComponents MethodsBFT and BFS
4. Solving the Problems using BFS
Coloring PixelsShortest Clear Path

bookCongratulations

Congrats, you completed all necessary steps!

You implemented different functions that using BFS which may be useful for the Graph class. For now, the last tiny step is to think about some code reorganization and optimal usage.

You may notice that methods above usually contain similar code, and some methods can reuse others. For example, hasOneComponent() and getComponents() do the similar action, so we can combine them.

Let's go to the tasks!

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Section 3. Chapter 1
toggle bottom row

bookCongratulations

Congrats, you completed all necessary steps!

You implemented different functions that using BFS which may be useful for the Graph class. For now, the last tiny step is to think about some code reorganization and optimal usage.

You may notice that methods above usually contain similar code, and some methods can reuse others. For example, hasOneComponent() and getComponents() do the similar action, so we can combine them.

Let's go to the tasks!

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Section 3. Chapter 1
toggle bottom row

bookCongratulations

Congrats, you completed all necessary steps!

You implemented different functions that using BFS which may be useful for the Graph class. For now, the last tiny step is to think about some code reorganization and optimal usage.

You may notice that methods above usually contain similar code, and some methods can reuse others. For example, hasOneComponent() and getComponents() do the similar action, so we can combine them.

Let's go to the tasks!

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Congrats, you completed all necessary steps!

You implemented different functions that using BFS which may be useful for the Graph class. For now, the last tiny step is to think about some code reorganization and optimal usage.

You may notice that methods above usually contain similar code, and some methods can reuse others. For example, hasOneComponent() and getComponents() do the similar action, so we can combine them.

Let's go to the tasks!

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Section 3. Chapter 1
Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
some-alt