Not returning a transitive closure #2
Description
From what I understand, this prototype is supposed to be able to compute the transitive closure of a graph's edge relation. A scalable solution to this problem would be interesting to me. However, even for the following toyexample graph, the procedure terminates without computing any new edges although the transitive closure should clearly have 31.
0 1 e
1 2 e
2 3 e
2 4 e
4 1 e
5 6 e
6 7 e
7 8 e
8 6 e
0 0 n
1 1 n
2 2 n
3 3 n
4 4 n
5 5 n
6 6 n
7 7 n
8 8 n
I'm using the latest version and running the script via ./graspan-java-run.sh toyexample 2 no rules_np from within the executables directory.
Are my expectations off, or did I misunderstand what you are trying to compute? For the httpd_df (from ASPLOS'17) I do get some output but I cannot assume its correctness as long as even smaller graphs don't produce the expected results. Can you elaborate on why the above example file does not result in a transitive closure of cardinality 31?