The non-recursive depth-first traversal algorithm of the graph i

The non-recursive depth-first traversal algorithm of the graph is usually implemented by a queue, and the non-recursive breadth-first traversal algorithm usually adopts a stack implementation. ~@[](2)

答案：FALSE