Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Directed graph not discovered #27

Open
nnfm58 opened this issue Mar 11, 2024 · 2 comments
Open

Directed graph not discovered #27

nnfm58 opened this issue Mar 11, 2024 · 2 comments

Comments

@nnfm58
Copy link

nnfm58 commented Mar 11, 2024

I would like to point out that some directed graphs are not being discovered by the algorithm. Input example:

t # 0
v 0 2
v 1 1
v 2 3
e 0 1 1
e 2 0 2
t # -1

With a support =1, the algorithm outputs as frequent the subgraphs with 2 vertices but the algorithm seems not to generate the candidate with 3 vertices. Is there something I am missing? The following is the code's output:

t # 0
v 0 2
v 1 1
e 0 1 1

t # 1
v 0 3
v 1 2
e 0 1 2

Thanks in advance for your time.

@m1zhangjh
Copy link

I found the same problem. If the directed edge's frm.vlb > to.vlb, the subgraph mining does not consider it in get_forward_XXX_edges

@nnfm58
Copy link
Author

nnfm58 commented Aug 22, 2024

did you find a solution?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants