You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
The text was updated successfully, but these errors were encountered:
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.
The text was updated successfully, but these errors were encountered: