Which graph traversal algorithm guarantees that the entire connected component is visited Depth$-$First Search $($DFS$)$ before moving to the next component?

Breadth$-$First Search $($BFS$)$

Dijkstra's Algorithm

Prim's Algorithm