Depth-first search on a graph is a generalization of preorder traversal on a tree. The difference is that when dealing with a graph, we need to avoid cycles.答案：TRUE
