If a connected graph G has no topological sorting sequence, then

If a connected graph G has no topological sorting sequence, then graph G must have a cycle. ~@[](2)

答案：TRUE