Contenu du cours
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.
Swipe to start coding
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.
Solution
Passez à un bureau pour une pratique réelleContinuez d'où vous êtes en utilisant l'une des options ci-dessousMerci pour vos commentaires !
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.
Swipe to start coding
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.
Solution
Passez à un bureau pour une pratique réelleContinuez d'où vous êtes en utilisant l'une des options ci-dessousMerci pour vos commentaires !
Passez à un bureau pour une pratique réelleContinuez d'où vous êtes en utilisant l'une des options ci-dessous