Subgraph matching is to find all subgraphs in a data graph that are isomorphic an existing query graph. NP-hard problem, yet has found its applications many areas. Many learning-based methods have been proposed for matching, whereas few designed subgraph matching. The problem generally more challenging, mainly due the different sizes between two graphs, resulting considerable large space of sol...