Based on the depth-first searching method, all the frequent subgraphs could he searched by adding edges progressively.

• 在此基础上，算法利用深度优先的思想，通过逐步扩展频繁边找出所有频繁子图。