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.

Завдання

Implement getComponents() function.

Завдання

Implement getComponents() function.

Перейдіть на комп'ютер для реальної практикиПродовжуйте з того місця, де ви зупинились, використовуючи один з наведених нижче варіантів

Все було зрозуміло?

Секція 2. Розділ 5

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.

Завдання

Implement getComponents() function.

Завдання

Implement getComponents() function.

Все було зрозуміло?

Секція 2. Розділ 5

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.

Завдання

Implement getComponents() function.

Завдання

Implement getComponents() function.

Все було зрозуміло?

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.

Завдання

Implement getComponents() function.

Секція 2. Розділ 5