gSpan

gSpan copied to clipboard

Hi, In the readme file under `graphdata` folder, there are some strange characters as follows, ``` NOTICE: 1. All labels cannot be ¡°0¡± or ¡°1¡±, and it should be larger...

cxw-droid

Thank you for providing this gSpan implementation. For me, it is incredibly fast. Unfortunately, in the result, there are only paths and trees, but no cyclic graphs. Is this a...

chtinnes

Support for counting repeated substructure patterns in the same graph

1

Hi, It is a nice implementation of gSpan, and I appreciate this project and the efforts you have paid deeply. Specifically, I wish to revise the implementation a little bit...

juntaoc

Hi, first of all thank you for the great work! As I mentioned in an earlier issue I used your package for the practical part in my Bachelor Thesis. I...

blumewas

## Modification Adding `isomorph_graphs` to the report frame. ## Use Case Some applications in graph mining require to perform subgraph-isomorphism-tests between the generated features and the graphs in the dataset....

blumewas

Add upper_bound for mined freq. subgraphs

1

Hi, first of all thank you for the great work! As I mentioned in an earlier issue I used your package for the practical part in my Bachelor Thesis. I...

blumewas

请教关于forward edge的问题

3

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

BuShiFeiGuo

修改代码的请教

1

你好 我通过测试也发现了这个问题 ，第一个图有2个同构图，第二个图有3个同构图。那么加在一起应该5个。可是运行得到2个 。可否告知一下，如果我想得到5个，该如何修改代码呢？

iiphenoix

你好我这边实验的时候有16000个联通图，support设置的4000，内存最高到了20g然后被系统杀死

Mrxianche

Question about calculating support by considering pattern occurrences inside each graph

8

Hi, this work is great and very helpful, but I notice that the policy to calculate the support of a certain pattern is to count the same pattern for only...

w-zx