Which of the following is a FALSE statement?

A. The time complexity of depth-first search (DFS) is O(|V|+|E|), where V and E are the vertex and edge sets of a graph, respectively.

B. Breadth-first search (BFS) can be used to find the topological ordering of a directed acyclic graph (DAG).

C. DFS can be used to visit all vertices of a graph, no matter this graph is connected or not.

D. None.

E. All.