Why is the brute-force approach less ideal here?

Question

Why is the brute-force approach less ideal here?

Option A — Correct answer

It repeatedly scans edges instead of reusing adjacency lists.

Option B

It is always constant time

Option C

It avoids graph traversal entirely

Option D

It works only on sorted arrays

Explanation

It repeatedly scans edges instead of reusing adjacency lists.

Connected Components - Adjacency DFS Pattern Practice Quiz