Зміст курсу
Breadth First Search
Breadth First Search
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:
Завдання
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.
Завдання
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.
Перейдіть на комп'ютер для реальної практикиПродовжуйте з того місця, де ви зупинились, використовуючи один з наведених нижче варіантівВсе було зрозуміло?
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:
Завдання
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.
Завдання
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.
Перейдіть на комп'ютер для реальної практикиПродовжуйте з того місця, де ви зупинились, використовуючи один з наведених нижче варіантівВсе було зрозуміло?
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:
Завдання
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.
Завдання
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.
Перейдіть на комп'ютер для реальної практикиПродовжуйте з того місця, де ви зупинились, використовуючи один з наведених нижче варіантівВсе було зрозуміло?
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:
Завдання
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.
Перейдіть на комп'ютер для реальної практикиПродовжуйте з того місця, де ви зупинились, використовуючи один з наведених нижче варіантівПерейдіть на комп'ютер для реальної практикиПродовжуйте з того місця, де ви зупинились, використовуючи один з наведених нижче варіантів