Multiple choice Which of the following algorithms solves the connected components problem? Greedy Depth-First Search Dynamic Programming Divide & Conquer Reveal answer Fill a bubble to check yourself B Correct answer Explanation Connected components in an undirected graph are found by performing a traversal (DFS or BFS) starting from each unvisited node.