Breadth First Traversal for graph with multiple connected components
This is not a fundamental difference.  You can easily do BFS on a graph with multiple connected components by using the same loop as in lines 5-7 of the DFS procedure you show:


for each vertex $u \in G.V$:


if $u.\text{color} == \textsf{white}$:


BFS($G,u$)