We studied graph algorithms that compute Topological Sorts and Strongly Connected Components of directed graphs. Here are two statements of what both algorithms presumably have in common:

$($A$)$ Both algorithms are based on Depth$-$First$-$Search $($DFS$).$

$($B$)$ Both algorithms are based on Breadth$-$First$-$Search $($BFS$).$

$($C$)$ Both algorithms require that the input graphs do not have any cycles.

$($D$)$ Both algorithms require that the input graphs have cycles.

Which one$($s$)$ is$($are$)$ true?

Group of answer choices

B and C

A and D

Only A

Only B