Breadth First Traverse
The goal of this task is to create method BFT (Breadth First Traverse) to demonstrate the traverse. Consider that this method works only for some components, and the argument is the starting node. To keep track, you need to use a queue to push() and pop() objects. Here, you can use list for this and methods append() and pop(0).
When you traverse the graph, push nodes to the queue, that havenβt been visited yet. Thus, you need to track it in the visited array, which contains True, if node i is already visited, or False, if not.
Here is a BFS example again:
Swipe to start coding
Algorithm is next:
-
Push start vertex to queue and label it as visited in
visitedarray -
if the queue is not empty, go to the step 3. Else leave the function.
-
Get the current
nodefrom queue, andpushto the queue all unvisited neighbors. Label them as visited. -
Output which node you add and content of the queue on each step to demonstrate how it works.
Solution
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.69Breadth First Traverse
Swipe to show menu
The goal of this task is to create method BFT (Breadth First Traverse) to demonstrate the traverse. Consider that this method works only for some components, and the argument is the starting node. To keep track, you need to use a queue to push() and pop() objects. Here, you can use list for this and methods append() and pop(0).
When you traverse the graph, push nodes to the queue, that havenβt been visited yet. Thus, you need to track it in the visited array, which contains True, if node i is already visited, or False, if not.
Here is a BFS example again:
Swipe to start coding
Algorithm is next:
-
Push start vertex to queue and label it as visited in
visitedarray -
if the queue is not empty, go to the step 3. Else leave the function.
-
Get the current
nodefrom queue, andpushto the queue all unvisited neighbors. Label them as visited. -
Output which node you add and content of the queue on each step to demonstrate how it works.
Solution
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
