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
visitedlist: put0if vertex is not visited yet, or putkif vertex is inkth component. - Return tuple of lists of vertex numbers, one list for each component. Create it by using an upgraded
visitedlist.
Tâche
Swipe to start coding
Implement getComponents() function.
Tout était clair ?
Merci pour vos commentaires !
Section 2. Chapitre 5
single
Demandez à l'IA
Demandez à l'IA
Posez n'importe quelle question ou essayez l'une des questions suggérées pour commencer notre discussion
Suggested prompts:
Résumer ce chapitre
Expliquer le code dans file
Expliquer pourquoi file ne résout pas la tâche
Awesome!
Completion rate improved to 7.69Find All Connected Components
Glissez pour afficher le menu
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
visitedlist: put0if vertex is not visited yet, or putkif vertex is inkth component. - Return tuple of lists of vertex numbers, one list for each component. Create it by using an upgraded
visitedlist.
Tâche
Swipe to start coding
Implement getComponents() function.
Passez à un bureau pour une pratique réelleContinuez d'où vous êtes en utilisant l'une des options ci-dessousTout était clair ?
Merci pour vos commentaires !
Awesome!
Completion rate improved to 7.69Section 2. Chapitre 5
single
