How to map the patterns in the input graph

betterenvi / gSpan

Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.

https://pypi.org/project/gspan-mining/

MIT License

198 stars 90 forks source link

How to map the patterns in the input graph #7

Closed dtchuink closed 6 years ago

dtchuink commented 6 years ago

Thanks for the code. I tried it and it is working fine.

However, I have an issue. Once i have the patterns, how can i match them or find them in the input graph. I read the paper about the algorithm and i know that vertexes are relabeled. How can i use the patterns since i cannot match them in the input? I've been stocked here for a couple of days and i will really appreciate your help.

Thanks.

betterenvi commented 6 years ago

This issue is similar to https://github.com/betterenvi/gSpan/issues/5