请教关于forward edge的问题

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

请教关于forward edge的问题 #13

Open BuShiFeiGuo opened 4 years ago

BuShiFeiGuo commented 4 years ago

请问在_get_forward_pure_edges 和 _get_forward_rmpath_edges时， if min_vlb <= g.vertices[e.to].vlb 以及 if (rm_edge.to == e.to or min_vlb > new_to_vlb or
history.has_vertex(e.to)): continue 这里比较边的时候，为什么比较的顶点的值，而不是编号呢？不应该是比较顶点在原图中的编号来确定最右路径吗？

taingload commented 1 year ago

我也感觉这一块有点问题，自己改改了～

nnfm58 commented 7 months ago

How did you fix it? It is problematic for me too, particularly for directed graphs. Just by changing the vertex labels for the values? Did it work for you? I would appreciate it if you share your solution. I am sorry I do not speak Chinese; Google Translate will help me in case you prefer to answer in Chinese.