BFT and BFS
First, Copy and Paste the whole implemented class Graph to the Editor, and save it somewhere outside for safety.
BFS and BFT do the same action, too, but in bfs() we search until end vertex is found. Actually, we can pass unnecessary end node to the bft() and change algorithm a bit, but avoid using to almost the same functions bfs() and bft().
Swipe to start coding
Change the bft() function by adding an unnecessary vertex end as a parameter, so you could refactor it like the bfs() function.
Thanks for your feedback!
single
Ask AI
Ask AI
Ask anything or try one of the suggested questions to begin our chat
Summarize this chapter
Explain the code in file
Explain why file doesn't solve the task
Awesome!
Completion rate improved to 7.69BFT and BFS
Swipe to show menu
First, Copy and Paste the whole implemented class Graph to the Editor, and save it somewhere outside for safety.
BFS and BFT do the same action, too, but in bfs() we search until end vertex is found. Actually, we can pass unnecessary end node to the bft() and change algorithm a bit, but avoid using to almost the same functions bfs() and bft().
Swipe to start coding
Change the bft() function by adding an unnecessary vertex end as a parameter, so you could refactor it like the bfs() function.
Switch to desktop for real-world practiceContinue from where you are using one of the options belowThanks for your feedback!
Awesome!
Completion rate improved to 7.69single
