FSP adopts the depth-first search strategy to mine frequent connected subgraphs efficiently,without candidate generation.

• 基于这种字典顺序,FSP算法不需要生成候选,采用深度优先搜索策略挖掘频繁连通子图。