In a graph G, if we have to do BFS twice to visit every one of i

In a graph G, if we have to do BFS twice to visit every one of its vertices, then there must be two connected components in G. ~@[](2)

答案：TRUE