Performs a depth-first walk of the input tree, this is the same depth-first algorithm you learned in programming 101.
对输入树进行深度优先的遍历，这和您在编程101中所学的深度优先算法没有什么不同。
To solve the above two problems, authors propose a new depth-first algorithm to discover weighted maximal frequent subgraphs only.
为解决上述问题，提出了一种深度优先的挖掘加权最大频繁子图的新算法。
To solve the above two problems, authors propose a new depth-first algorithm to discover weighted maximal frequent subgraphs only.
为解决上述问题，提出了一种深度优先的挖掘加权最大频繁子图的新算法。
应用推荐