Conteúdo do Curso
Breadth First Search
Breadth First Search
Check if is One Component
BFS: check if graph is one-component
In the previous method, we considered that the graph is one-component. That’s because if you start traversing at some node, you’ll visit only nodes from the same component.
If there are some other components, you should start from vertices of another component.
Tarefa
Think about Implementation of method hasOneComponent(). which returns True if it is only one component in graph.
Modify your g graph by adding nodes in that way, so there are miltiple components, and check how function works.
Tarefa
Think about Implementation of method hasOneComponent(). which returns True if it is only one component in graph.
Modify your g graph by adding nodes in that way, so there are miltiple components, and check how function works.
Mude para o desktop para praticar no mundo realContinue de onde você está usando uma das opções abaixoTudo estava claro?
Check if is One Component
BFS: check if graph is one-component
In the previous method, we considered that the graph is one-component. That’s because if you start traversing at some node, you’ll visit only nodes from the same component.
If there are some other components, you should start from vertices of another component.
Tarefa
Think about Implementation of method hasOneComponent(). which returns True if it is only one component in graph.
Modify your g graph by adding nodes in that way, so there are miltiple components, and check how function works.
Tarefa
Think about Implementation of method hasOneComponent(). which returns True if it is only one component in graph.
Modify your g graph by adding nodes in that way, so there are miltiple components, and check how function works.
Mude para o desktop para praticar no mundo realContinue de onde você está usando uma das opções abaixoTudo estava claro?
Check if is One Component
BFS: check if graph is one-component
In the previous method, we considered that the graph is one-component. That’s because if you start traversing at some node, you’ll visit only nodes from the same component.
If there are some other components, you should start from vertices of another component.
Tarefa
Think about Implementation of method hasOneComponent(). which returns True if it is only one component in graph.
Modify your g graph by adding nodes in that way, so there are miltiple components, and check how function works.
Tarefa
Think about Implementation of method hasOneComponent(). which returns True if it is only one component in graph.
Modify your g graph by adding nodes in that way, so there are miltiple components, and check how function works.
Mude para o desktop para praticar no mundo realContinue de onde você está usando uma das opções abaixoTudo estava claro?
BFS: check if graph is one-component
In the previous method, we considered that the graph is one-component. That’s because if you start traversing at some node, you’ll visit only nodes from the same component.
If there are some other components, you should start from vertices of another component.
Tarefa
Think about Implementation of method hasOneComponent(). which returns True if it is only one component in graph.
Modify your g graph by adding nodes in that way, so there are miltiple components, and check how function works.
Mude para o desktop para praticar no mundo realContinue de onde você está usando uma das opções abaixoMude para o desktop para praticar no mundo realContinue de onde você está usando uma das opções abaixo