Contenido del Curso

Breadth First Search

1. What is BFS

How to Search Graph Class Implementation

2. Practice

Breadth First Traverse Check if is One Component Shortest Path in Graph Restoring Shortest Path Find All Connected Components Is a Tree

3. Improve Your Code

Congratulations Components Methods BFT and BFS

4. Solving the Problems using BFS

Coloring Pixels Shortest Clear Path

Find All Connected Components

BFS find all connected components

Complicate the problem: find all components in a graph.

Some hints for you:

When you’re done with the first component, save it, and start traversing again with some nodes that haven’t been visited yet.
To split your components, you can use an upgraded visited list: put 0 if vertex is not visited yet, or put k if vertex is in kth component.
Return tuple of lists of vertex numbers, one list for each component. Create it by using an upgraded visited list.

Tarea

Implement getComponents() function.

Tarea

Implement getComponents() function.

Cambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones

¿Todo estuvo claro?

Sección 2. Capítulo 5

Find All Connected Components

BFS find all connected components

Complicate the problem: find all components in a graph.

Some hints for you:

When you’re done with the first component, save it, and start traversing again with some nodes that haven’t been visited yet.
To split your components, you can use an upgraded visited list: put 0 if vertex is not visited yet, or put k if vertex is in kth component.
Return tuple of lists of vertex numbers, one list for each component. Create it by using an upgraded visited list.

Tarea

Implement getComponents() function.

Tarea

Implement getComponents() function.

Cambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones

¿Todo estuvo claro?

Sección 2. Capítulo 5

Find All Connected Components

BFS find all connected components

Complicate the problem: find all components in a graph.

Some hints for you:

When you’re done with the first component, save it, and start traversing again with some nodes that haven’t been visited yet.
To split your components, you can use an upgraded visited list: put 0 if vertex is not visited yet, or put k if vertex is in kth component.
Return tuple of lists of vertex numbers, one list for each component. Create it by using an upgraded visited list.

Tarea

Implement getComponents() function.

Tarea

Implement getComponents() function.

Cambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones

¿Todo estuvo claro?

BFS find all connected components

Complicate the problem: find all components in a graph.

Some hints for you:

When you’re done with the first component, save it, and start traversing again with some nodes that haven’t been visited yet.
To split your components, you can use an upgraded visited list: put 0 if vertex is not visited yet, or put k if vertex is in kth component.
Return tuple of lists of vertex numbers, one list for each component. Create it by using an upgraded visited list.

Tarea

Implement getComponents() function.

Cambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones

Sección 2. Capítulo 5

Cambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones