The algorithm transforms the subgraph isomorphism problem into a matching problem between vertexes through the introduction of similarity features for every vertex.

• 通过单个顶点的相似度特征，将子图同构问题转化为顶点之间的匹配问题。