If in a directed graph, every vertex is part of some cycle, then

If in a directed graph, every vertex is part of some cycle, then the graph must be strongly connected. ~@[](2)

答案：FALSE